./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:02:37,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:02:37,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:02:37,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:02:37,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:02:37,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:02:37,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:02:37,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:02:37,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:02:37,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:02:37,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:02:37,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:02:37,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:02:37,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:02:37,238 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:02:37,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:02:37,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:02:37,238 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:02:37,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:02:37,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:02:37,239 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:02:37,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:02:37,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:02:37,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:37,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:02:37,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:02:37,240 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:02:37,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:02:37,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:02:37,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:02:37,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:02:37,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:02:37,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:02:37,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:02:37,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/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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2025-03-17 06:02:37,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:02:37,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:02:37,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:02:37,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:02:37,543 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:02:37,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2025-03-17 06:02:38,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63de0595/fbe379fd0f4748ba9ef9996225350aea/FLAG2b9b0512f [2025-03-17 06:02:39,068 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:02:39,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2025-03-17 06:02:39,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63de0595/fbe379fd0f4748ba9ef9996225350aea/FLAG2b9b0512f [2025-03-17 06:02:39,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63de0595/fbe379fd0f4748ba9ef9996225350aea [2025-03-17 06:02:39,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:02:39,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:02:39,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:39,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:02:39,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:02:39,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39, skipping insertion in model container [2025-03-17 06:02:39,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:02:39,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i[916,929] [2025-03-17 06:02:39,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:39,575 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:02:39,583 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i[916,929] [2025-03-17 06:02:39,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:39,648 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:02:39,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39 WrapperNode [2025-03-17 06:02:39,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:39,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:39,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:02:39,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:02:39,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,713 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2025-03-17 06:02:39,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:39,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:02:39,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:02:39,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:02:39,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,742 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:02:39,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:02:39,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:02:39,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:02:39,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:02:39,774 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (1/1) ... [2025-03-17 06:02:39,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:39,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:02:39,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:02:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:02:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:02:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:02:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:02:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:02:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:02:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:02:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:02:39,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:02:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:02:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:02:39,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:02:39,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:02:39,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:02:40,359 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem78#1;havoc property_#t~ite85#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite107#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1; [2025-03-17 06:02:40,395 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-17 06:02:40,395 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:02:40,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:02:40,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:02:40,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:40 BoogieIcfgContainer [2025-03-17 06:02:40,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:02:40,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:02:40,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:02:40,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:02:40,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:02:39" (1/3) ... [2025-03-17 06:02:40,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b82ff40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:40, skipping insertion in model container [2025-03-17 06:02:40,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:39" (2/3) ... [2025-03-17 06:02:40,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b82ff40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:40, skipping insertion in model container [2025-03-17 06:02:40,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:40" (3/3) ... [2025-03-17 06:02:40,411 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2025-03-17 06:02:40,426 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:02:40,428 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-84.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:02:40,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:02:40,500 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;@70cc8b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:02:40,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:02:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 74 states have (on average 1.364864864864865) internal successors, (101), 75 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:02:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 06:02:40,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:40,515 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:40,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:40,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1422528057, now seen corresponding path program 1 times [2025-03-17 06:02:40,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:40,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751385652] [2025-03-17 06:02:40,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:40,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 06:02:40,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 06:02:40,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:40,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 06:02:40,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:40,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751385652] [2025-03-17 06:02:40,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751385652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124548857] [2025-03-17 06:02:40,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:40,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:40,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:40,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:40,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:02:41,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 06:02:41,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 06:02:41,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:41,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:41,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:02:41,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 06:02:41,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:41,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:41,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:41,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:02:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574382934] [2025-03-17 06:02:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:02:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:41,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:02:41,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:41,154 INFO L87 Difference]: Start difference. First operand has 97 states, 74 states have (on average 1.364864864864865) internal successors, (101), 75 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:02:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:41,173 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2025-03-17 06:02:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:02:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 146 [2025-03-17 06:02:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:41,179 INFO L225 Difference]: With dead ends: 191 [2025-03-17 06:02:41,179 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 06:02:41,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:41,184 INFO L435 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:41,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 06:02:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 06:02:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:02:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-17 06:02:41,220 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 146 [2025-03-17 06:02:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:41,220 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-17 06:02:41,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:02:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-17 06:02:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 06:02:41,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:41,224 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:41,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:02:41,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:02:41,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:41,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:41,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1143692971, now seen corresponding path program 1 times [2025-03-17 06:02:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065455591] [2025-03-17 06:02:41,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:41,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 06:02:41,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 06:02:41,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:41,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:02:42,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:42,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065455591] [2025-03-17 06:02:42,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065455591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:42,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:42,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:02:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212747232] [2025-03-17 06:02:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:42,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:42,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:42,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:42,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:42,267 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:02:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:42,650 INFO L93 Difference]: Finished difference Result 314 states and 452 transitions. [2025-03-17 06:02:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:42,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2025-03-17 06:02:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:42,653 INFO L225 Difference]: With dead ends: 314 [2025-03-17 06:02:42,653 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 06:02:42,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:42,654 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 190 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:42,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 365 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:02:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 06:02:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 189. [2025-03-17 06:02:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 146 states have internal predecessors, (192), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:02:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2025-03-17 06:02:42,692 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 146 [2025-03-17 06:02:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:42,692 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2025-03-17 06:02:42,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:02:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2025-03-17 06:02:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:02:42,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:42,694 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:42,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:02:42,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:42,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash 510976775, now seen corresponding path program 1 times [2025-03-17 06:02:42,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278671387] [2025-03-17 06:02:42,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:42,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:02:42,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:02:42,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:42,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:02:42,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278671387] [2025-03-17 06:02:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278671387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:42,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:42,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550018331] [2025-03-17 06:02:42,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:42,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:42,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:42,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:42,852 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:02:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:42,882 INFO L93 Difference]: Finished difference Result 383 states and 551 transitions. [2025-03-17 06:02:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:42,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 06:02:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:42,885 INFO L225 Difference]: With dead ends: 383 [2025-03-17 06:02:42,886 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 06:02:42,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:42,888 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:42,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 393 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 06:02:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-03-17 06:02:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:02:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 276 transitions. [2025-03-17 06:02:42,917 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 276 transitions. Word has length 154 [2025-03-17 06:02:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:42,917 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 276 transitions. [2025-03-17 06:02:42,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:02:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 276 transitions. [2025-03-17 06:02:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:02:42,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:42,923 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:42,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:02:42,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:42,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:42,924 INFO L85 PathProgramCache]: Analyzing trace with hash 511900296, now seen corresponding path program 1 times [2025-03-17 06:02:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:42,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761422464] [2025-03-17 06:02:42,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:42,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:02:43,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:02:43,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:43,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:02:46,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:46,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761422464] [2025-03-17 06:02:46,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761422464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:46,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:46,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:02:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856303455] [2025-03-17 06:02:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:46,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:02:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:46,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:02:46,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:02:46,121 INFO L87 Difference]: Start difference. First operand 193 states and 276 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:47,629 INFO L93 Difference]: Finished difference Result 609 states and 861 transitions. [2025-03-17 06:02:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 06:02:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 154 [2025-03-17 06:02:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:47,634 INFO L225 Difference]: With dead ends: 609 [2025-03-17 06:02:47,636 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 06:02:47,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:02:47,639 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 182 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:47,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1336 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 06:02:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 06:02:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 223. [2025-03-17 06:02:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 180 states have (on average 1.3166666666666667) internal successors, (237), 180 states have internal predecessors, (237), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:02:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 317 transitions. [2025-03-17 06:02:47,663 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 317 transitions. Word has length 154 [2025-03-17 06:02:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:47,663 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 317 transitions. [2025-03-17 06:02:47,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 317 transitions. [2025-03-17 06:02:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:02:47,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:47,665 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:47,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:02:47,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:47,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash 723251209, now seen corresponding path program 1 times [2025-03-17 06:02:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801624293] [2025-03-17 06:02:47,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:47,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:02:47,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:02:47,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:47,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:02:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:49,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801624293] [2025-03-17 06:02:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801624293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:49,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:02:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52275645] [2025-03-17 06:02:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:49,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:02:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:49,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:02:49,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:02:49,748 INFO L87 Difference]: Start difference. First operand 223 states and 317 transitions. Second operand has 14 states, 12 states have (on average 4.75) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:50,674 INFO L93 Difference]: Finished difference Result 523 states and 741 transitions. [2025-03-17 06:02:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:02:50,675 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.75) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 154 [2025-03-17 06:02:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:50,677 INFO L225 Difference]: With dead ends: 523 [2025-03-17 06:02:50,677 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 06:02:50,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:02:50,678 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 59 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:50,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1084 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:02:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 06:02:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 227. [2025-03-17 06:02:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 184 states have (on average 1.3206521739130435) internal successors, (243), 184 states have internal predecessors, (243), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:02:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2025-03-17 06:02:50,696 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 154 [2025-03-17 06:02:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:50,696 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2025-03-17 06:02:50,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.75) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2025-03-17 06:02:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:02:50,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:50,700 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:50,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:02:50,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:50,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1465646166, now seen corresponding path program 1 times [2025-03-17 06:02:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61996956] [2025-03-17 06:02:50,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:50,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:02:50,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:02:50,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:50,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:02:52,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61996956] [2025-03-17 06:02:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61996956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:52,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:02:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865182822] [2025-03-17 06:02:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:52,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:02:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:52,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:02:52,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:02:52,159 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:53,361 INFO L93 Difference]: Finished difference Result 563 states and 795 transitions. [2025-03-17 06:02:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:02:53,361 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-17 06:02:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:53,363 INFO L225 Difference]: With dead ends: 563 [2025-03-17 06:02:53,363 INFO L226 Difference]: Without dead ends: 337 [2025-03-17 06:02:53,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:02:53,367 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 57 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:53,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 845 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:02:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-17 06:02:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2025-03-17 06:02:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 284 states have (on average 1.3380281690140845) internal successors, (380), 286 states have internal predecessors, (380), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 06:02:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 468 transitions. [2025-03-17 06:02:53,395 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 468 transitions. Word has length 156 [2025-03-17 06:02:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:53,395 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 468 transitions. [2025-03-17 06:02:53,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 468 transitions. [2025-03-17 06:02:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:02:53,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:53,398 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:53,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:02:53,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:53,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1976180343, now seen corresponding path program 1 times [2025-03-17 06:02:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523981719] [2025-03-17 06:02:53,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:53,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:53,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:02:53,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:02:53,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:53,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:02:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523981719] [2025-03-17 06:02:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523981719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:02:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282049283] [2025-03-17 06:02:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:02:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:54,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:02:54,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:02:54,929 INFO L87 Difference]: Start difference. First operand 333 states and 468 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:56,066 INFO L93 Difference]: Finished difference Result 685 states and 956 transitions. [2025-03-17 06:02:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:02:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-17 06:02:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:56,069 INFO L225 Difference]: With dead ends: 685 [2025-03-17 06:02:56,071 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 06:02:56,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:02:56,072 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 57 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:56,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 930 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:02:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 06:02:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 345. [2025-03-17 06:02:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 290 states have (on average 1.3241379310344827) internal successors, (384), 292 states have internal predecessors, (384), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 06:02:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 480 transitions. [2025-03-17 06:02:56,096 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 480 transitions. Word has length 156 [2025-03-17 06:02:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:56,096 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 480 transitions. [2025-03-17 06:02:56,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 480 transitions. [2025-03-17 06:02:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:02:56,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:56,098 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:56,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:02:56,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:56,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:56,099 INFO L85 PathProgramCache]: Analyzing trace with hash 657179402, now seen corresponding path program 1 times [2025-03-17 06:02:56,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:56,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411906142] [2025-03-17 06:02:56,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:56,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:02:56,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:02:56,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:56,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:02:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411906142] [2025-03-17 06:02:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411906142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:57,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:57,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:02:57,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204535107] [2025-03-17 06:02:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:57,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:02:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:57,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:02:57,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:02:57,352 INFO L87 Difference]: Start difference. First operand 345 states and 480 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:58,400 INFO L93 Difference]: Finished difference Result 797 states and 1103 transitions. [2025-03-17 06:02:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:02:58,400 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-17 06:02:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:58,406 INFO L225 Difference]: With dead ends: 797 [2025-03-17 06:02:58,406 INFO L226 Difference]: Without dead ends: 453 [2025-03-17 06:02:58,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:02:58,408 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 54 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:58,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 810 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:02:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-17 06:02:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2025-03-17 06:02:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 388 states have (on average 1.327319587628866) internal successors, (515), 392 states have internal predecessors, (515), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:02:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 619 transitions. [2025-03-17 06:02:58,448 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 619 transitions. Word has length 156 [2025-03-17 06:02:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:58,449 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 619 transitions. [2025-03-17 06:02:58,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:02:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 619 transitions. [2025-03-17 06:02:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:02:58,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:58,450 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:58,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:02:58,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:58,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:58,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1399375142, now seen corresponding path program 1 times [2025-03-17 06:02:58,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:58,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045177056] [2025-03-17 06:02:58,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:58,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:02:58,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:02:58,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:58,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:00,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:00,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045177056] [2025-03-17 06:03:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045177056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:03:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052415352] [2025-03-17 06:03:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:00,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:03:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:00,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:03:00,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:03:00,743 INFO L87 Difference]: Start difference. First operand 449 states and 619 transitions. Second operand has 13 states, 10 states have (on average 5.9) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:03:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:02,383 INFO L93 Difference]: Finished difference Result 1149 states and 1565 transitions. [2025-03-17 06:03:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 06:03:02,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.9) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2025-03-17 06:03:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:02,390 INFO L225 Difference]: With dead ends: 1149 [2025-03-17 06:03:02,390 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 06:03:02,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:03:02,393 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 209 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:02,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 952 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 06:03:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 06:03:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 533. [2025-03-17 06:03:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 476 states have internal predecessors, (625), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:03:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 729 transitions. [2025-03-17 06:03:02,435 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 729 transitions. Word has length 156 [2025-03-17 06:03:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:02,436 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 729 transitions. [2025-03-17 06:03:02,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.9) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:03:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 729 transitions. [2025-03-17 06:03:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:03:02,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:02,439 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:02,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:03:02,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:02,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -339892951, now seen corresponding path program 1 times [2025-03-17 06:03:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:02,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164259384] [2025-03-17 06:03:02,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:02,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:03:02,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:03:02,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:02,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164259384] [2025-03-17 06:03:02,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164259384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:02,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:02,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688628917] [2025-03-17 06:03:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:02,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:02,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:02,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:02,639 INFO L87 Difference]: Start difference. First operand 533 states and 729 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:02,904 INFO L93 Difference]: Finished difference Result 1325 states and 1789 transitions. [2025-03-17 06:03:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:02,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 06:03:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:02,908 INFO L225 Difference]: With dead ends: 1325 [2025-03-17 06:03:02,908 INFO L226 Difference]: Without dead ends: 793 [2025-03-17 06:03:02,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:02,910 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 43 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:02,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 422 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-17 06:03:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 549. [2025-03-17 06:03:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 488 states have (on average 1.3135245901639345) internal successors, (641), 492 states have internal predecessors, (641), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:03:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 745 transitions. [2025-03-17 06:03:02,952 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 745 transitions. Word has length 156 [2025-03-17 06:03:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:02,952 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 745 transitions. [2025-03-17 06:03:02,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 745 transitions. [2025-03-17 06:03:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:03:02,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:02,954 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:02,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:03:02,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:02,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1167658858, now seen corresponding path program 1 times [2025-03-17 06:03:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:02,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541284055] [2025-03-17 06:03:02,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:02,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:03:03,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:03:03,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:03,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541284055] [2025-03-17 06:03:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541284055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:04,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:04,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:03:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431797926] [2025-03-17 06:03:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:04,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:03:04,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:04,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:03:04,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:03:04,559 INFO L87 Difference]: Start difference. First operand 549 states and 745 transitions. Second operand has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:03:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:05,900 INFO L93 Difference]: Finished difference Result 1237 states and 1667 transitions. [2025-03-17 06:03:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:03:05,901 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2025-03-17 06:03:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:05,905 INFO L225 Difference]: With dead ends: 1237 [2025-03-17 06:03:05,906 INFO L226 Difference]: Without dead ends: 689 [2025-03-17 06:03:05,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:03:05,908 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 50 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:05,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 880 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 06:03:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-17 06:03:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 545. [2025-03-17 06:03:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 484 states have (on average 1.31198347107438) internal successors, (635), 488 states have internal predecessors, (635), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:03:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 739 transitions. [2025-03-17 06:03:05,935 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 739 transitions. Word has length 156 [2025-03-17 06:03:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:05,935 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 739 transitions. [2025-03-17 06:03:05,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 06:03:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 739 transitions. [2025-03-17 06:03:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:03:05,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:05,937 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:05,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:03:05,937 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:05,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -677834201, now seen corresponding path program 1 times [2025-03-17 06:03:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867887371] [2025-03-17 06:03:05,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:05,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:03:05,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:03:05,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:05,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:06,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:06,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867887371] [2025-03-17 06:03:06,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867887371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:06,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:06,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:06,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170450230] [2025-03-17 06:03:06,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:06,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:06,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:06,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:06,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:06,501 INFO L87 Difference]: Start difference. First operand 545 states and 739 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:03:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:06,989 INFO L93 Difference]: Finished difference Result 1393 states and 1878 transitions. [2025-03-17 06:03:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:06,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 156 [2025-03-17 06:03:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:06,993 INFO L225 Difference]: With dead ends: 1393 [2025-03-17 06:03:06,993 INFO L226 Difference]: Without dead ends: 849 [2025-03-17 06:03:06,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:06,995 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 59 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:06,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 594 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:03:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-03-17 06:03:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 845. [2025-03-17 06:03:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 748 states have (on average 1.2981283422459893) internal successors, (971), 758 states have internal predecessors, (971), 80 states have call successors, (80), 16 states have call predecessors, (80), 16 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 06:03:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1131 transitions. [2025-03-17 06:03:07,042 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1131 transitions. Word has length 156 [2025-03-17 06:03:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:07,043 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1131 transitions. [2025-03-17 06:03:07,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:03:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1131 transitions. [2025-03-17 06:03:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:03:07,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:07,044 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:07,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:03:07,045 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:07,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1454330039, now seen corresponding path program 1 times [2025-03-17 06:03:07,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:07,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605482676] [2025-03-17 06:03:07,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:07,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:07,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:03:07,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:03:07,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:07,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:07,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605482676] [2025-03-17 06:03:07,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605482676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:07,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:07,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:07,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158076266] [2025-03-17 06:03:07,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:07,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:07,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:07,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:07,684 INFO L87 Difference]: Start difference. First operand 845 states and 1131 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:03:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:08,145 INFO L93 Difference]: Finished difference Result 1913 states and 2545 transitions. [2025-03-17 06:03:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 156 [2025-03-17 06:03:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:08,151 INFO L225 Difference]: With dead ends: 1913 [2025-03-17 06:03:08,151 INFO L226 Difference]: Without dead ends: 1069 [2025-03-17 06:03:08,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:08,154 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 60 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:08,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 510 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:03:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-03-17 06:03:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 796. [2025-03-17 06:03:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 703 states have (on average 1.3115220483641536) internal successors, (922), 711 states have internal predecessors, (922), 76 states have call successors, (76), 16 states have call predecessors, (76), 16 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 06:03:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1074 transitions. [2025-03-17 06:03:08,204 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1074 transitions. Word has length 156 [2025-03-17 06:03:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:08,205 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1074 transitions. [2025-03-17 06:03:08,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:03:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1074 transitions. [2025-03-17 06:03:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:03:08,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:08,206 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:08,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:03:08,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:08,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash -492716022, now seen corresponding path program 1 times [2025-03-17 06:03:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287283855] [2025-03-17 06:03:08,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:08,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:03:08,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:03:08,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:08,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287283855] [2025-03-17 06:03:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287283855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:09,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:09,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:03:09,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450913464] [2025-03-17 06:03:09,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:09,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:03:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:09,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:03:09,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:09,147 INFO L87 Difference]: Start difference. First operand 796 states and 1074 transitions. Second operand has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:09,711 INFO L93 Difference]: Finished difference Result 1694 states and 2266 transitions. [2025-03-17 06:03:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:03:09,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-17 06:03:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:09,717 INFO L225 Difference]: With dead ends: 1694 [2025-03-17 06:03:09,717 INFO L226 Difference]: Without dead ends: 899 [2025-03-17 06:03:09,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:03:09,719 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 51 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:09,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 586 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:03:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-03-17 06:03:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 776. [2025-03-17 06:03:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 683 states have (on average 1.2913616398243046) internal successors, (882), 691 states have internal predecessors, (882), 76 states have call successors, (76), 16 states have call predecessors, (76), 16 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 06:03:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1034 transitions. [2025-03-17 06:03:09,762 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1034 transitions. Word has length 156 [2025-03-17 06:03:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:09,763 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1034 transitions. [2025-03-17 06:03:09,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1034 transitions. [2025-03-17 06:03:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:03:09,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:09,764 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:09,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:03:09,764 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:09,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1003250199, now seen corresponding path program 1 times [2025-03-17 06:03:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:09,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414947573] [2025-03-17 06:03:09,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:09,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:03:09,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:03:09,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:09,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:10,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:10,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414947573] [2025-03-17 06:03:10,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414947573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:10,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:10,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:03:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322329068] [2025-03-17 06:03:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:10,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:03:10,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:10,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:03:10,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:03:10,761 INFO L87 Difference]: Start difference. First operand 776 states and 1034 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:11,810 INFO L93 Difference]: Finished difference Result 1751 states and 2312 transitions. [2025-03-17 06:03:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:03:11,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-17 06:03:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:11,815 INFO L225 Difference]: With dead ends: 1751 [2025-03-17 06:03:11,815 INFO L226 Difference]: Without dead ends: 976 [2025-03-17 06:03:11,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:11,819 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 54 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:11,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 857 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:03:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-17 06:03:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 790. [2025-03-17 06:03:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 697 states have (on average 1.2883787661406025) internal successors, (898), 705 states have internal predecessors, (898), 76 states have call successors, (76), 16 states have call predecessors, (76), 16 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 06:03:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1050 transitions. [2025-03-17 06:03:11,864 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1050 transitions. Word has length 156 [2025-03-17 06:03:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:11,864 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1050 transitions. [2025-03-17 06:03:11,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1050 transitions. [2025-03-17 06:03:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:03:11,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:11,866 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:11,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:03:11,866 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:11,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1178974985, now seen corresponding path program 1 times [2025-03-17 06:03:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:11,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053811541] [2025-03-17 06:03:11,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:11,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:11,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:03:11,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:03:11,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:11,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:12,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053811541] [2025-03-17 06:03:12,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053811541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:12,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:12,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:03:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866531582] [2025-03-17 06:03:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:12,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:03:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:12,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:03:12,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:03:12,923 INFO L87 Difference]: Start difference. First operand 790 states and 1050 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:13,896 INFO L93 Difference]: Finished difference Result 1700 states and 2244 transitions. [2025-03-17 06:03:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:03:13,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-17 06:03:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:13,908 INFO L225 Difference]: With dead ends: 1700 [2025-03-17 06:03:13,908 INFO L226 Difference]: Without dead ends: 911 [2025-03-17 06:03:13,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:03:13,910 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:13,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 923 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:03:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-03-17 06:03:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 749. [2025-03-17 06:03:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 661 states have (on average 1.281391830559758) internal successors, (847), 668 states have internal predecessors, (847), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 991 transitions. [2025-03-17 06:03:13,949 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 991 transitions. Word has length 156 [2025-03-17 06:03:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:13,950 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 991 transitions. [2025-03-17 06:03:13,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 991 transitions. [2025-03-17 06:03:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:03:13,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:13,951 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:13,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:03:13,952 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 413618916, now seen corresponding path program 1 times [2025-03-17 06:03:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:13,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998132364] [2025-03-17 06:03:13,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:13,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:03:14,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:03:14,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998132364] [2025-03-17 06:03:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998132364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:15,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:03:15,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908287505] [2025-03-17 06:03:15,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:15,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:03:15,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:15,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:03:15,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:15,357 INFO L87 Difference]: Start difference. First operand 749 states and 991 transitions. Second operand has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:15,936 INFO L93 Difference]: Finished difference Result 1528 states and 2016 transitions. [2025-03-17 06:03:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:03:15,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-17 06:03:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:15,940 INFO L225 Difference]: With dead ends: 1528 [2025-03-17 06:03:15,940 INFO L226 Difference]: Without dead ends: 780 [2025-03-17 06:03:15,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:03:15,942 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:15,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 822 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:03:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-17 06:03:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 723. [2025-03-17 06:03:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 634 states have (on average 1.2870662460567823) internal successors, (816), 641 states have internal predecessors, (816), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 960 transitions. [2025-03-17 06:03:15,984 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 960 transitions. Word has length 156 [2025-03-17 06:03:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:15,985 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 960 transitions. [2025-03-17 06:03:15,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 960 transitions. [2025-03-17 06:03:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:03:15,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:15,986 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:15,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:03:15,986 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1389425748, now seen corresponding path program 1 times [2025-03-17 06:03:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:15,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049057505] [2025-03-17 06:03:15,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:15,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:16,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:16,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:16,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:16,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:17,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:17,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049057505] [2025-03-17 06:03:17,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049057505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:17,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:17,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 06:03:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422523570] [2025-03-17 06:03:17,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 06:03:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:17,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 06:03:17,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2025-03-17 06:03:17,906 INFO L87 Difference]: Start difference. First operand 723 states and 960 transitions. Second operand has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:19,285 INFO L93 Difference]: Finished difference Result 1947 states and 2576 transitions. [2025-03-17 06:03:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:03:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-17 06:03:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:19,290 INFO L225 Difference]: With dead ends: 1947 [2025-03-17 06:03:19,290 INFO L226 Difference]: Without dead ends: 1225 [2025-03-17 06:03:19,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-03-17 06:03:19,291 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 235 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:19,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1699 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:03:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-17 06:03:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2025-03-17 06:03:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 686 states have (on average 1.2944606413994169) internal successors, (888), 693 states have internal predecessors, (888), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1032 transitions. [2025-03-17 06:03:19,335 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1032 transitions. Word has length 158 [2025-03-17 06:03:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:19,335 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1032 transitions. [2025-03-17 06:03:19,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1032 transitions. [2025-03-17 06:03:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:03:19,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:19,337 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:19,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 06:03:19,337 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:19,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:19,338 INFO L85 PathProgramCache]: Analyzing trace with hash 118126061, now seen corresponding path program 1 times [2025-03-17 06:03:19,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:19,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822277666] [2025-03-17 06:03:19,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:19,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:19,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:19,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:19,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:19,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:19,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:19,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822277666] [2025-03-17 06:03:19,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822277666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:19,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520916416] [2025-03-17 06:03:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:19,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:19,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:19,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:19,502 INFO L87 Difference]: Start difference. First operand 775 states and 1032 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:19,810 INFO L93 Difference]: Finished difference Result 1840 states and 2424 transitions. [2025-03-17 06:03:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:19,810 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 06:03:19,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:19,813 INFO L225 Difference]: With dead ends: 1840 [2025-03-17 06:03:19,813 INFO L226 Difference]: Without dead ends: 1066 [2025-03-17 06:03:19,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:19,815 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 43 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:19,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 451 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-17 06:03:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 771. [2025-03-17 06:03:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 682 states have (on average 1.281524926686217) internal successors, (874), 689 states have internal predecessors, (874), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1018 transitions. [2025-03-17 06:03:19,855 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1018 transitions. Word has length 158 [2025-03-17 06:03:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:19,855 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1018 transitions. [2025-03-17 06:03:19,856 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1018 transitions. [2025-03-17 06:03:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:03:19,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:19,857 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:19,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 06:03:19,857 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash -878946292, now seen corresponding path program 1 times [2025-03-17 06:03:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392781859] [2025-03-17 06:03:19,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:19,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:19,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:19,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:19,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:20,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392781859] [2025-03-17 06:03:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392781859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:20,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:03:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770069834] [2025-03-17 06:03:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:20,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:03:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:20,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:03:20,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:20,845 INFO L87 Difference]: Start difference. First operand 771 states and 1018 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:21,526 INFO L93 Difference]: Finished difference Result 1732 states and 2272 transitions. [2025-03-17 06:03:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:03:21,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-17 06:03:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:21,530 INFO L225 Difference]: With dead ends: 1732 [2025-03-17 06:03:21,531 INFO L226 Difference]: Without dead ends: 962 [2025-03-17 06:03:21,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:21,532 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 51 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:21,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 613 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:03:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-17 06:03:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 771. [2025-03-17 06:03:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 682 states have (on average 1.2639296187683284) internal successors, (862), 689 states have internal predecessors, (862), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1006 transitions. [2025-03-17 06:03:21,601 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1006 transitions. Word has length 158 [2025-03-17 06:03:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:21,602 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1006 transitions. [2025-03-17 06:03:21,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1006 transitions. [2025-03-17 06:03:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:03:21,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:21,604 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:21,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 06:03:21,604 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:21,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash -144661267, now seen corresponding path program 1 times [2025-03-17 06:03:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:21,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377552196] [2025-03-17 06:03:21,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:21,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377552196] [2025-03-17 06:03:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377552196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:03:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369827710] [2025-03-17 06:03:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:23,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:03:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:23,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:03:23,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:03:23,033 INFO L87 Difference]: Start difference. First operand 771 states and 1006 transitions. Second operand has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:24,197 INFO L93 Difference]: Finished difference Result 1703 states and 2216 transitions. [2025-03-17 06:03:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 06:03:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-17 06:03:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:24,201 INFO L225 Difference]: With dead ends: 1703 [2025-03-17 06:03:24,201 INFO L226 Difference]: Without dead ends: 933 [2025-03-17 06:03:24,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:03:24,202 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 51 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:24,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1417 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:03:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-17 06:03:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 779. [2025-03-17 06:03:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 690 states have (on average 1.2666666666666666) internal successors, (874), 697 states have internal predecessors, (874), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1018 transitions. [2025-03-17 06:03:24,241 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1018 transitions. Word has length 158 [2025-03-17 06:03:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:24,241 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1018 transitions. [2025-03-17 06:03:24,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1018 transitions. [2025-03-17 06:03:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:03:24,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:24,243 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:24,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:03:24,243 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:24,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash -696324051, now seen corresponding path program 1 times [2025-03-17 06:03:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:24,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508811455] [2025-03-17 06:03:24,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:24,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:24,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:24,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:24,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:24,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508811455] [2025-03-17 06:03:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508811455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:24,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667551340] [2025-03-17 06:03:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:24,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:24,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:24,402 INFO L87 Difference]: Start difference. First operand 779 states and 1018 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:24,687 INFO L93 Difference]: Finished difference Result 1676 states and 2180 transitions. [2025-03-17 06:03:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:24,688 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 06:03:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:24,691 INFO L225 Difference]: With dead ends: 1676 [2025-03-17 06:03:24,691 INFO L226 Difference]: Without dead ends: 898 [2025-03-17 06:03:24,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:24,697 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 58 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:24,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 386 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-17 06:03:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 723. [2025-03-17 06:03:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 634 states have (on average 1.2618296529968454) internal successors, (800), 641 states have internal predecessors, (800), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 944 transitions. [2025-03-17 06:03:24,737 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 944 transitions. Word has length 158 [2025-03-17 06:03:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:24,738 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 944 transitions. [2025-03-17 06:03:24,738 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 944 transitions. [2025-03-17 06:03:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:03:24,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:24,739 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:24,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 06:03:24,739 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:24,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 465348448, now seen corresponding path program 1 times [2025-03-17 06:03:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:24,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524393848] [2025-03-17 06:03:24,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:24,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:24,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:24,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:24,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:24,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:03:24,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524393848] [2025-03-17 06:03:24,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524393848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:03:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663137985] [2025-03-17 06:03:24,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:24,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:24,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:03:24,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:03:24,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:03:25,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:25,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:25,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:25,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:25,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:03:25,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:25,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663137985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:25,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:03:25,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 06:03:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517043532] [2025-03-17 06:03:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:25,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:25,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:25,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:03:25,158 INFO L87 Difference]: Start difference. First operand 723 states and 944 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:25,221 INFO L93 Difference]: Finished difference Result 1472 states and 1923 transitions. [2025-03-17 06:03:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:25,221 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 06:03:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:25,224 INFO L225 Difference]: With dead ends: 1472 [2025-03-17 06:03:25,224 INFO L226 Difference]: Without dead ends: 750 [2025-03-17 06:03:25,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:03:25,226 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:25,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:03:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-17 06:03:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2025-03-17 06:03:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 661 states have (on average 1.2511346444780636) internal successors, (827), 668 states have internal predecessors, (827), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 971 transitions. [2025-03-17 06:03:25,267 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 971 transitions. Word has length 158 [2025-03-17 06:03:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:25,267 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 971 transitions. [2025-03-17 06:03:25,267 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 971 transitions. [2025-03-17 06:03:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:03:25,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:25,268 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:25,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:03:25,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 06:03:25,469 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2099018860, now seen corresponding path program 1 times [2025-03-17 06:03:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021549145] [2025-03-17 06:03:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:25,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:25,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:25,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:25,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:27,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021549145] [2025-03-17 06:03:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021549145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:27,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:27,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 06:03:27,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080195904] [2025-03-17 06:03:27,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:27,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 06:03:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:27,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 06:03:27,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:03:27,082 INFO L87 Difference]: Start difference. First operand 750 states and 971 transitions. Second operand has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:28,557 INFO L93 Difference]: Finished difference Result 1913 states and 2462 transitions. [2025-03-17 06:03:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:03:28,559 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-17 06:03:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:28,564 INFO L225 Difference]: With dead ends: 1913 [2025-03-17 06:03:28,565 INFO L226 Difference]: Without dead ends: 1164 [2025-03-17 06:03:28,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:03:28,568 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 165 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:28,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1893 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:03:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-03-17 06:03:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 782. [2025-03-17 06:03:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 693 states have (on average 1.2481962481962483) internal successors, (865), 700 states have internal predecessors, (865), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1009 transitions. [2025-03-17 06:03:28,613 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1009 transitions. Word has length 158 [2025-03-17 06:03:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:28,613 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1009 transitions. [2025-03-17 06:03:28,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1009 transitions. [2025-03-17 06:03:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:03:28,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:28,616 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:28,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 06:03:28,616 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:28,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash -951183955, now seen corresponding path program 1 times [2025-03-17 06:03:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:28,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306034655] [2025-03-17 06:03:28,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:28,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:03:28,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:03:28,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:28,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:29,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:29,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306034655] [2025-03-17 06:03:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306034655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:29,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:03:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461846030] [2025-03-17 06:03:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:03:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:29,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:03:29,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:03:29,974 INFO L87 Difference]: Start difference. First operand 782 states and 1009 transitions. Second operand has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:31,271 INFO L93 Difference]: Finished difference Result 1685 states and 2168 transitions. [2025-03-17 06:03:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 06:03:31,271 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-17 06:03:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:31,275 INFO L225 Difference]: With dead ends: 1685 [2025-03-17 06:03:31,275 INFO L226 Difference]: Without dead ends: 904 [2025-03-17 06:03:31,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:03:31,276 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 50 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:31,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1512 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:03:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-03-17 06:03:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 734. [2025-03-17 06:03:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 645 states have (on average 1.2511627906976743) internal successors, (807), 652 states have internal predecessors, (807), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 951 transitions. [2025-03-17 06:03:31,316 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 951 transitions. Word has length 158 [2025-03-17 06:03:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:31,316 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 951 transitions. [2025-03-17 06:03:31,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 06:03:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 951 transitions. [2025-03-17 06:03:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 06:03:31,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:31,317 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:31,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 06:03:31,317 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:31,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 74944898, now seen corresponding path program 1 times [2025-03-17 06:03:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:31,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029108102] [2025-03-17 06:03:31,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:31,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:03:31,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:03:31,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:31,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:31,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029108102] [2025-03-17 06:03:31,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029108102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:31,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:31,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:31,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125482749] [2025-03-17 06:03:31,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:31,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:31,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:31,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:31,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:31,547 INFO L87 Difference]: Start difference. First operand 734 states and 951 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:31,976 INFO L93 Difference]: Finished difference Result 2037 states and 2613 transitions. [2025-03-17 06:03:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:31,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 06:03:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:31,981 INFO L225 Difference]: With dead ends: 2037 [2025-03-17 06:03:31,981 INFO L226 Difference]: Without dead ends: 1304 [2025-03-17 06:03:31,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:31,985 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 98 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:31,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 280 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-03-17 06:03:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 931. [2025-03-17 06:03:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 842 states have (on average 1.2304038004750595) internal successors, (1036), 849 states have internal predecessors, (1036), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 06:03:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1180 transitions. [2025-03-17 06:03:32,036 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1180 transitions. Word has length 160 [2025-03-17 06:03:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:32,036 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1180 transitions. [2025-03-17 06:03:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1180 transitions. [2025-03-17 06:03:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 06:03:32,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:32,038 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:32,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 06:03:32,039 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:32,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -908858851, now seen corresponding path program 1 times [2025-03-17 06:03:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611824146] [2025-03-17 06:03:32,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:32,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:03:32,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:03:32,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:32,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:03:32,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:03:32,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:03:32,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:03:32,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:32,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:03:32,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:03:32,260 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:03:32,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:03:32,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 06:03:32,265 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] [2025-03-17 06:03:32,331 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:03:32,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:03:32 BoogieIcfgContainer [2025-03-17 06:03:32,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:03:32,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:03:32,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:03:32,342 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:03:32,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:40" (3/4) ... [2025-03-17 06:03:32,345 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:03:32,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:03:32,346 INFO L158 Benchmark]: Toolchain (without parser) took 52965.77ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 158.4MB in the beginning and 473.7MB in the end (delta: -315.3MB). Peak memory consumption was 509.7MB. Max. memory is 16.1GB. [2025-03-17 06:03:32,347 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:03:32,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.95ms. Allocated memory is still 201.3MB. Free memory was 158.4MB in the beginning and 141.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:03:32,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.97ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 137.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:03:32,347 INFO L158 Benchmark]: Boogie Preprocessor took 58.23ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 134.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:03:32,347 INFO L158 Benchmark]: IcfgBuilder took 630.69ms. Allocated memory is still 201.3MB. Free memory was 134.1MB in the beginning and 100.3MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:03:32,348 INFO L158 Benchmark]: TraceAbstraction took 51936.19ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 99.7MB in the beginning and 478.1MB in the end (delta: -378.4MB). Peak memory consumption was 442.6MB. Max. memory is 16.1GB. [2025-03-17 06:03:32,348 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 1.0GB. Free memory was 478.1MB in the beginning and 473.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:03:32,349 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.95ms. Allocated memory is still 201.3MB. Free memory was 158.4MB in the beginning and 141.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.97ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 137.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.23ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 134.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 630.69ms. Allocated memory is still 201.3MB. Free memory was 134.1MB in the beginning and 100.3MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 51936.19ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 99.7MB in the beginning and 478.1MB in the end (delta: -378.4MB). Peak memory consumption was 442.6MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 1.0GB. Free memory was 478.1MB in the beginning and 473.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 113. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L57] unsigned short int last_1_WrapperStruct00_var_1_8 = 64; [L58] signed short int last_1_WrapperStruct00_var_1_11 = -4; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_8 [L116] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L117] EXPR WrapperStruct00.var_1_11 [L117] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L84] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L87] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L90] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L93] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] RET updateVariables() [L129] CALL step() [L62] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L63] COND TRUE stepLocal_0 != last_1_WrapperStruct00_var_1_8 [L64] EXPR WrapperStruct00.var_1_4 [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L64] EXPR WrapperStruct00.var_1_7 [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))) [L68] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L68] COND TRUE WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_10 [L69] EXPR WrapperStruct00.var_1_6 [L69] WrapperStruct00.var_1_8 = ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)) [L71] EXPR WrapperStruct00.var_1_5 [L71] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L71] COND TRUE ! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10) [L72] WrapperStruct00.var_1_16 = (32 - 8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L76] EXPR WrapperStruct00.var_1_18 [L76] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L77] EXPR WrapperStruct00.var_1_1 [L77] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L77] COND FALSE !(WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) [L120] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) [L120] EXPR WrapperStruct00.var_1_17 [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120-L121] return (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 161 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.8s, OverallIterations: 27, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2016 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1980 mSDsluCounter, 21216 SdHoareTripleChecker+Invalid, 16.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17789 mSDsCounter, 209 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14802 IncrementalHoareTripleChecker+Invalid, 15011 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 209 mSolverCounterUnsat, 3427 mSDtfsCounter, 14802 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 927 GetRequests, 627 SyntacticMatches, 2 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=931occurred in iteration=26, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 3868 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 4514 NumberOfCodeBlocks, 4514 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4326 ConstructedInterpolants, 0 QuantifiedInterpolants, 14435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1090 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 28 InterpolantComputations, 26 PerfectInterpolantSequences, 21185/21280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:03:32,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:03:36,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:03:36,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:03:36,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:03:36,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:03:36,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:03:36,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:03:36,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:03:36,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:03:36,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:03:36,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:03:36,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:03:36,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:03:36,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:03:36,502 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:03:36,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:03:36,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:03:36,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:03:36,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:03:36,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:03:36,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:03:36,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:03:36,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:03:36,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:03:36,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:03:36,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:03:36,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:03:36,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:03:36,510 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:03:36,510 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:03:36,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:03:36,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:03:36,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:03:36,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:03:36,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2025-03-17 06:03:36,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:03:37,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:03:37,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:03:37,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:03:37,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:03:37,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2025-03-17 06:03:38,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afb39750/c9a061b1e06b4213980861ef26e350a0/FLAG28db2f156 [2025-03-17 06:03:39,373 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:03:39,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2025-03-17 06:03:39,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afb39750/c9a061b1e06b4213980861ef26e350a0/FLAG28db2f156 [2025-03-17 06:03:39,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afb39750/c9a061b1e06b4213980861ef26e350a0 [2025-03-17 06:03:39,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:03:39,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:03:39,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:03:39,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:03:39,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:03:39,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:03:39" (1/1) ... [2025-03-17 06:03:39,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313432dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:39, skipping insertion in model container [2025-03-17 06:03:39,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:03:39" (1/1) ... [2025-03-17 06:03:39,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:03:39,919 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i[916,929] [2025-03-17 06:03:40,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:03:40,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:03:40,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i[916,929] [2025-03-17 06:03:40,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:03:40,159 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:03:40,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40 WrapperNode [2025-03-17 06:03:40,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:03:40,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:03:40,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:03:40,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:03:40,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,258 INFO L138 Inliner]: procedures = 34, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2025-03-17 06:03:40,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:03:40,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:03:40,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:03:40,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:03:40,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,313 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-17 06:03:40,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:03:40,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:03:40,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:03:40,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:03:40,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (1/1) ... [2025-03-17 06:03:40,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:03:40,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:03:40,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:03:40,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:03:40,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:03:40,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:03:40,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:03:40,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:03:40,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:03:40,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:03:40,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:03:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:03:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:03:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:03:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:03:40,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:03:40,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:03:40,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:03:40,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:03:40,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:03:40,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:03:40,608 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:03:40,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:03:41,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem78#1;havoc property_#t~ite85#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite107#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1; [2025-03-17 06:03:41,682 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-17 06:03:41,683 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:03:41,706 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:03:41,707 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:03:41,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:03:41 BoogieIcfgContainer [2025-03-17 06:03:41,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:03:41,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:03:41,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:03:41,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:03:41,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:03:39" (1/3) ... [2025-03-17 06:03:41,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40676323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:03:41, skipping insertion in model container [2025-03-17 06:03:41,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:03:40" (2/3) ... [2025-03-17 06:03:41,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40676323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:03:41, skipping insertion in model container [2025-03-17 06:03:41,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:03:41" (3/3) ... [2025-03-17 06:03:41,724 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2025-03-17 06:03:41,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:03:41,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-84.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:03:41,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:03:41,852 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;@d4848fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:03:41,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:03:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 74 states have (on average 1.364864864864865) internal successors, (101), 75 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:03:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 06:03:41,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:41,880 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:41,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:41,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -785589487, now seen corresponding path program 1 times [2025-03-17 06:03:41,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982151513] [2025-03-17 06:03:41,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:41,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:41,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:41,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:03:41,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:03:42,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 06:03:42,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 06:03:42,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:42,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:42,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:03:42,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-17 06:03:42,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:42,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982151513] [2025-03-17 06:03:42,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982151513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:42,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:42,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:03:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726500326] [2025-03-17 06:03:42,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:42,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:03:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:42,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:03:42,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:03:42,374 INFO L87 Difference]: Start difference. First operand has 97 states, 74 states have (on average 1.364864864864865) internal successors, (101), 75 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:03:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:42,411 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2025-03-17 06:03:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:03:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 146 [2025-03-17 06:03:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:42,426 INFO L225 Difference]: With dead ends: 191 [2025-03-17 06:03:42,427 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 06:03:42,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:03:42,435 INFO L435 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:42,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:03:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 06:03:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 06:03:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:03:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-17 06:03:42,501 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 146 [2025-03-17 06:03:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:42,501 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-17 06:03:42,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:03:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-17 06:03:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 06:03:42,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:42,512 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:42,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 06:03:42,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:42,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:42,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash -506754401, now seen corresponding path program 1 times [2025-03-17 06:03:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:42,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341609607] [2025-03-17 06:03:42,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:42,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:42,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:42,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:03:42,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:03:42,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 06:03:43,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 06:03:43,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:43,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:43,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:03:43,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:43,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:43,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:43,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341609607] [2025-03-17 06:03:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341609607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:43,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:43,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917115564] [2025-03-17 06:03:43,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:43,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:43,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:43,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:43,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:43,195 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:43,391 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-03-17 06:03:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:43,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2025-03-17 06:03:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:43,394 INFO L225 Difference]: With dead ends: 196 [2025-03-17 06:03:43,395 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:03:43,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:43,396 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:43,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 633 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:03:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:03:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:03:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-17 06:03:43,407 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 146 [2025-03-17 06:03:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:43,408 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-17 06:03:43,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-17 06:03:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 06:03:43,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:43,411 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:43,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:03:43,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:43,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash -505830880, now seen corresponding path program 1 times [2025-03-17 06:03:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980547942] [2025-03-17 06:03:43,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:43,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:43,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:43,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:03:43,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:03:43,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 06:03:44,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 06:03:44,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:44,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:44,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:03:44,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:44,214 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 88 treesize of output 87 [2025-03-17 06:03:44,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 122 [2025-03-17 06:03:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:03:45,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:45,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:45,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980547942] [2025-03-17 06:03:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980547942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:45,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:03:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843489854] [2025-03-17 06:03:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:45,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:45,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:45,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:45,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:45,047 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:46,974 INFO L93 Difference]: Finished difference Result 302 states and 428 transitions. [2025-03-17 06:03:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2025-03-17 06:03:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:46,983 INFO L225 Difference]: With dead ends: 302 [2025-03-17 06:03:46,984 INFO L226 Difference]: Without dead ends: 202 [2025-03-17 06:03:46,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:46,991 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 68 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:46,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 472 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 06:03:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-17 06:03:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 167. [2025-03-17 06:03:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 124 states have internal predecessors, (158), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:03:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 238 transitions. [2025-03-17 06:03:47,042 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 238 transitions. Word has length 146 [2025-03-17 06:03:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:47,042 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 238 transitions. [2025-03-17 06:03:47,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:03:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 238 transitions. [2025-03-17 06:03:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:03:47,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:47,055 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:47,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:03:47,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:47,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:47,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1921762350, now seen corresponding path program 1 times [2025-03-17 06:03:47,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:47,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953604406] [2025-03-17 06:03:47,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:47,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:47,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:47,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:03:47,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:03:47,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:03:47,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:03:47,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:47,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:47,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:03:47,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:47,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 06:03:47,849 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 14 treesize of output 10 [2025-03-17 06:03:47,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-17 06:03:48,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:48,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-03-17 06:03:48,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:48,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2025-03-17 06:03:48,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:48,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-03-17 06:03:49,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:49,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-17 06:03:49,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:49,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-03-17 06:03:50,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:50,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-17 06:03:50,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:50,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-17 06:03:51,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:51,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 90 [2025-03-17 06:03:51,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:51,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 115 treesize of output 114 [2025-03-17 06:03:51,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:51,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 125 treesize of output 127 [2025-03-17 06:03:52,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:52,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 135 treesize of output 131 [2025-03-17 06:03:52,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:52,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 145 treesize of output 65 [2025-03-17 06:03:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 640 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 06:03:53,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:53,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:53,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953604406] [2025-03-17 06:03:53,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953604406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:53,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:53,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:03:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549753554] [2025-03-17 06:03:53,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:53,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:03:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:53,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:03:53,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:03:53,477 INFO L87 Difference]: Start difference. First operand 167 states and 238 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20)