./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.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-15.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 9e676a9bb9259ddb9063c9a4fa6515c5445e4b4dd1533585e7d2db7e7d77e030 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:54:12,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:54:12,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:54:12,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:54:12,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:54:12,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:54:12,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:54:12,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:54:12,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:54:12,459 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:54:12,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:54:12,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:54:12,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:54:12,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:54:12,461 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:54:12,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:54:12,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:54:12,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:54:12,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:54:12,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:54:12,463 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 -> 9e676a9bb9259ddb9063c9a4fa6515c5445e4b4dd1533585e7d2db7e7d77e030 [2025-03-17 05:54:12,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:54:12,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:54:12,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:54:12,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:54:12,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:54:12,685 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-15.i [2025-03-17 05:54:13,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1dbc07bc/072b7a2d79874cba8bc3799a1da57fcb/FLAG09b0feaa7 [2025-03-17 05:54:14,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:54:14,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i [2025-03-17 05:54:14,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1dbc07bc/072b7a2d79874cba8bc3799a1da57fcb/FLAG09b0feaa7 [2025-03-17 05:54:14,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1dbc07bc/072b7a2d79874cba8bc3799a1da57fcb [2025-03-17 05:54:14,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:54:14,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:54:14,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:54:14,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:54:14,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:54:14,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c442bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14, skipping insertion in model container [2025-03-17 05:54:14,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:54:14,519 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-15.i[916,929] [2025-03-17 05:54:14,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:54:14,561 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:54:14,570 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-15.i[916,929] [2025-03-17 05:54:14,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:54:14,608 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:54:14,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14 WrapperNode [2025-03-17 05:54:14,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:54:14,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:54:14,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:54:14,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:54:14,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,652 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-17 05:54:14,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:54:14,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:54:14,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:54:14,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:54:14,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,668 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 05:54:14,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:54:14,689 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:54:14,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:54:14,690 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:54:14,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (1/1) ... [2025-03-17 05:54:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:54:14,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:54:14,718 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 05:54:14,720 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 05:54:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:54:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 05:54:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 05:54:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 05:54:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 05:54:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 05:54:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 05:54:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:54:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:54:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 05:54:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:54:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:54:14,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:54:14,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:54:15,158 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short90#1;havoc property_#t~ite101#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite98#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short141#1; [2025-03-17 05:54:15,190 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-03-17 05:54:15,190 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:54:15,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:54:15,197 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:54:15,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:54:15 BoogieIcfgContainer [2025-03-17 05:54:15,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:54:15,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:54:15,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:54:15,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:54:15,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:54:14" (1/3) ... [2025-03-17 05:54:15,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241a6634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:54:15, skipping insertion in model container [2025-03-17 05:54:15,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:54:14" (2/3) ... [2025-03-17 05:54:15,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241a6634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:54:15, skipping insertion in model container [2025-03-17 05:54:15,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:54:15" (3/3) ... [2025-03-17 05:54:15,207 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-15.i [2025-03-17 05:54:15,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:54:15,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-15.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:54:15,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:54:15,265 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;@6abf5afe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:54:15,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:54:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 93 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:54:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:54:15,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:15,276 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:15,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:15,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash -33346453, now seen corresponding path program 1 times [2025-03-17 05:54:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:15,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244174951] [2025-03-17 05:54:15,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:15,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:54:15,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:54:15,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:15,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:54:15,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244174951] [2025-03-17 05:54:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244174951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:54:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832233347] [2025-03-17 05:54:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:15,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:54:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:54:15,583 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 05:54:15,585 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 05:54:15,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:54:15,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:54:15,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:15,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:15,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:54:15,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:54:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:54:15,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:54:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832233347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:15,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:54:15,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:54:15,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435171073] [2025-03-17 05:54:15,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:15,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:54:15,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:15,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:54:15,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:54:15,870 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 93 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:15,895 INFO L93 Difference]: Finished difference Result 211 states and 328 transitions. [2025-03-17 05:54:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:54:15,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2025-03-17 05:54:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:15,902 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:54:15,903 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:54:15,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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 05:54:15,909 INFO L435 NwaCegarLoop]: 153 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, 153 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 05:54:15,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:54:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:54:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 05:54:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:54:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-17 05:54:15,948 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 111 [2025-03-17 05:54:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:15,948 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-17 05:54:15,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-17 05:54:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:54:15,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:15,952 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:15,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:54:16,156 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 05:54:16,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:16,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2096111181, now seen corresponding path program 1 times [2025-03-17 05:54:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:16,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917387807] [2025-03-17 05:54:16,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:16,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:54:16,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:54:16,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:16,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917387807] [2025-03-17 05:54:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917387807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:16,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:54:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929259784] [2025-03-17 05:54:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:16,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:54:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:16,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:54:16,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:54:16,826 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:17,092 INFO L93 Difference]: Finished difference Result 265 states and 382 transitions. [2025-03-17 05:54:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:54:17,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:54:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:17,094 INFO L225 Difference]: With dead ends: 265 [2025-03-17 05:54:17,096 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 05:54:17,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 05:54:17,098 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 66 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:17,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 540 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:54:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 05:54:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-03-17 05:54:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.4028776978417266) internal successors, (195), 140 states have internal predecessors, (195), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:54:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2025-03-17 05:54:17,117 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 111 [2025-03-17 05:54:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:17,117 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2025-03-17 05:54:17,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2025-03-17 05:54:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:54:17,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:17,120 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:54:17,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:17,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1506572688, now seen corresponding path program 1 times [2025-03-17 05:54:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:17,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904243642] [2025-03-17 05:54:17,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:17,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:54:17,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:54:17,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:17,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904243642] [2025-03-17 05:54:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904243642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:18,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:18,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:54:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25874815] [2025-03-17 05:54:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:18,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:54:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:18,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:54:18,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:54:18,380 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:18,600 INFO L93 Difference]: Finished difference Result 472 states and 681 transitions. [2025-03-17 05:54:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:54:18,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-03-17 05:54:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:18,605 INFO L225 Difference]: With dead ends: 472 [2025-03-17 05:54:18,606 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 05:54:18,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:54:18,609 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 95 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:18,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 251 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:54:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 05:54:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2025-03-17 05:54:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 274 states have (on average 1.397810218978102) internal successors, (383), 276 states have internal predecessors, (383), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:54:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 447 transitions. [2025-03-17 05:54:18,637 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 447 transitions. Word has length 112 [2025-03-17 05:54:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:18,638 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 447 transitions. [2025-03-17 05:54:18,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 447 transitions. [2025-03-17 05:54:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:54:18,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:18,639 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:18,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:54:18,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1727622381, now seen corresponding path program 1 times [2025-03-17 05:54:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:18,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175113814] [2025-03-17 05:54:18,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:18,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:54:18,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:54:18,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:18,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:19,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:19,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175113814] [2025-03-17 05:54:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175113814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:19,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:19,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:54:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141767083] [2025-03-17 05:54:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:19,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:54:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:19,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:54:19,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:54:19,489 INFO L87 Difference]: Start difference. First operand 311 states and 447 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:19,698 INFO L93 Difference]: Finished difference Result 626 states and 899 transitions. [2025-03-17 05:54:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:54:19,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-17 05:54:19,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:19,700 INFO L225 Difference]: With dead ends: 626 [2025-03-17 05:54:19,700 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 05:54:19,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:54:19,701 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 101 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:19,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 311 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:54:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 05:54:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2025-03-17 05:54:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 275 states have (on average 1.3927272727272728) internal successors, (383), 277 states have internal predecessors, (383), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:54:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 447 transitions. [2025-03-17 05:54:19,728 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 447 transitions. Word has length 113 [2025-03-17 05:54:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:19,728 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 447 transitions. [2025-03-17 05:54:19,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 447 transitions. [2025-03-17 05:54:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:54:19,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:19,730 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:19,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:54:19,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:19,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1753524562, now seen corresponding path program 1 times [2025-03-17 05:54:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:19,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342233023] [2025-03-17 05:54:19,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:19,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:54:19,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:54:19,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:19,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:20,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342233023] [2025-03-17 05:54:20,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342233023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:20,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:20,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:54:20,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30101137] [2025-03-17 05:54:20,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:20,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:54:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:20,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:54:20,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:20,156 INFO L87 Difference]: Start difference. First operand 312 states and 447 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:20,563 INFO L93 Difference]: Finished difference Result 644 states and 923 transitions. [2025-03-17 05:54:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:54:20,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-17 05:54:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:20,566 INFO L225 Difference]: With dead ends: 644 [2025-03-17 05:54:20,566 INFO L226 Difference]: Without dead ends: 484 [2025-03-17 05:54:20,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:54:20,567 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 153 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:20,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 453 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:54:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-17 05:54:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 464. [2025-03-17 05:54:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 409 states have (on average 1.3936430317848412) internal successors, (570), 412 states have internal predecessors, (570), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:54:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 666 transitions. [2025-03-17 05:54:20,600 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 666 transitions. Word has length 114 [2025-03-17 05:54:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:20,601 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 666 transitions. [2025-03-17 05:54:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 666 transitions. [2025-03-17 05:54:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:54:20,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:20,602 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:20,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:54:20,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:20,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:20,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1344700337, now seen corresponding path program 1 times [2025-03-17 05:54:20,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:20,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636914704] [2025-03-17 05:54:20,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:20,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:54:20,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:54:20,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:20,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:21,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636914704] [2025-03-17 05:54:21,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636914704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:21,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:21,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:54:21,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376055207] [2025-03-17 05:54:21,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:21,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:54:21,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:21,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:54:21,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:54:21,504 INFO L87 Difference]: Start difference. First operand 464 states and 666 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:21,807 INFO L93 Difference]: Finished difference Result 1198 states and 1718 transitions. [2025-03-17 05:54:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:54:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-17 05:54:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:21,812 INFO L225 Difference]: With dead ends: 1198 [2025-03-17 05:54:21,812 INFO L226 Difference]: Without dead ends: 735 [2025-03-17 05:54:21,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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 05:54:21,816 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 57 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:21,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 457 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:54:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-17 05:54:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 537. [2025-03-17 05:54:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 482 states have (on average 1.4024896265560165) internal successors, (676), 485 states have internal predecessors, (676), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:54:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 772 transitions. [2025-03-17 05:54:21,852 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 772 transitions. Word has length 114 [2025-03-17 05:54:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:21,852 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 772 transitions. [2025-03-17 05:54:21,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 772 transitions. [2025-03-17 05:54:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:54:21,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:21,853 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:21,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:54:21,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:21,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash 832872457, now seen corresponding path program 1 times [2025-03-17 05:54:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70462794] [2025-03-17 05:54:21,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:21,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:21,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:54:21,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:54:21,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:21,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70462794] [2025-03-17 05:54:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70462794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:22,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:22,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:54:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237614004] [2025-03-17 05:54:22,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:22,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:54:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:22,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:54:22,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:54:22,125 INFO L87 Difference]: Start difference. First operand 537 states and 772 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:22,546 INFO L93 Difference]: Finished difference Result 1438 states and 2076 transitions. [2025-03-17 05:54:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:54:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-17 05:54:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:22,550 INFO L225 Difference]: With dead ends: 1438 [2025-03-17 05:54:22,552 INFO L226 Difference]: Without dead ends: 902 [2025-03-17 05:54:22,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:54:22,557 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 133 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:22,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1318 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:54:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-03-17 05:54:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 900. [2025-03-17 05:54:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 806 states have (on average 1.4057071960297767) internal successors, (1133), 809 states have internal predecessors, (1133), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1301 transitions. [2025-03-17 05:54:22,596 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1301 transitions. Word has length 114 [2025-03-17 05:54:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:22,596 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1301 transitions. [2025-03-17 05:54:22,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1301 transitions. [2025-03-17 05:54:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:54:22,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:22,601 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:22,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:54:22,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:22,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash -960291860, now seen corresponding path program 1 times [2025-03-17 05:54:22,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:22,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606233] [2025-03-17 05:54:22,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:22,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:54:22,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:54:22,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:22,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:23,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606233] [2025-03-17 05:54:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:23,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:54:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689135811] [2025-03-17 05:54:23,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:23,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:54:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:23,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:54:23,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:54:23,171 INFO L87 Difference]: Start difference. First operand 900 states and 1301 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:23,509 INFO L93 Difference]: Finished difference Result 1802 states and 2589 transitions. [2025-03-17 05:54:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:54:23,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-17 05:54:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:23,515 INFO L225 Difference]: With dead ends: 1802 [2025-03-17 05:54:23,516 INFO L226 Difference]: Without dead ends: 1195 [2025-03-17 05:54:23,517 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 05:54:23,518 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 65 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:23,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 594 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:54:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-03-17 05:54:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 896. [2025-03-17 05:54:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 802 states have (on average 1.3977556109725686) internal successors, (1121), 805 states have internal predecessors, (1121), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1289 transitions. [2025-03-17 05:54:23,568 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1289 transitions. Word has length 114 [2025-03-17 05:54:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:23,568 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1289 transitions. [2025-03-17 05:54:23,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1289 transitions. [2025-03-17 05:54:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:54:23,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:23,571 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:23,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:54:23,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:23,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash -794136598, now seen corresponding path program 1 times [2025-03-17 05:54:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:23,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041139297] [2025-03-17 05:54:23,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:23,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:54:23,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:54:23,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:23,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:24,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041139297] [2025-03-17 05:54:24,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041139297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:24,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:24,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:54:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619823739] [2025-03-17 05:54:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:24,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:54:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:24,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:54:24,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:54:24,211 INFO L87 Difference]: Start difference. First operand 896 states and 1289 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:24,486 INFO L93 Difference]: Finished difference Result 2088 states and 2986 transitions. [2025-03-17 05:54:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:54:24,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-17 05:54:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:24,492 INFO L225 Difference]: With dead ends: 2088 [2025-03-17 05:54:24,492 INFO L226 Difference]: Without dead ends: 1193 [2025-03-17 05:54:24,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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 05:54:24,495 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 62 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:24,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 432 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:54:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-17 05:54:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 892. [2025-03-17 05:54:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 798 states have (on average 1.387218045112782) internal successors, (1107), 801 states have internal predecessors, (1107), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1275 transitions. [2025-03-17 05:54:24,538 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1275 transitions. Word has length 115 [2025-03-17 05:54:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:24,538 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1275 transitions. [2025-03-17 05:54:24,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1275 transitions. [2025-03-17 05:54:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:54:24,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:24,540 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:24,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:54:24,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:24,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash -579710289, now seen corresponding path program 1 times [2025-03-17 05:54:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:24,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67014961] [2025-03-17 05:54:24,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:24,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:54:24,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:54:24,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:24,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:24,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67014961] [2025-03-17 05:54:24,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67014961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:24,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:24,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:54:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057201775] [2025-03-17 05:54:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:24,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:54:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:24,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:54:24,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:54:24,680 INFO L87 Difference]: Start difference. First operand 892 states and 1275 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:24,889 INFO L93 Difference]: Finished difference Result 1736 states and 2474 transitions. [2025-03-17 05:54:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:54:24,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-17 05:54:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:24,892 INFO L225 Difference]: With dead ends: 1736 [2025-03-17 05:54:24,893 INFO L226 Difference]: Without dead ends: 833 [2025-03-17 05:54:24,894 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 05:54:24,894 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 61 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:24,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 374 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:54:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-17 05:54:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 782. [2025-03-17 05:54:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 688 states have (on average 1.373546511627907) internal successors, (945), 691 states have internal predecessors, (945), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1113 transitions. [2025-03-17 05:54:24,924 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1113 transitions. Word has length 115 [2025-03-17 05:54:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:24,925 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1113 transitions. [2025-03-17 05:54:24,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1113 transitions. [2025-03-17 05:54:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:54:24,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:24,926 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:24,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:54:24,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:24,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash 240769780, now seen corresponding path program 1 times [2025-03-17 05:54:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099834571] [2025-03-17 05:54:24,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:24,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:54:24,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:54:24,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:24,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:25,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099834571] [2025-03-17 05:54:25,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099834571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:25,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:25,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:54:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630960766] [2025-03-17 05:54:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:25,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:54:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:25,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:54:25,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:54:25,617 INFO L87 Difference]: Start difference. First operand 782 states and 1113 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:26,426 INFO L93 Difference]: Finished difference Result 1690 states and 2396 transitions. [2025-03-17 05:54:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:54:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-17 05:54:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:26,432 INFO L225 Difference]: With dead ends: 1690 [2025-03-17 05:54:26,432 INFO L226 Difference]: Without dead ends: 909 [2025-03-17 05:54:26,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:54:26,434 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 239 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:26,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 663 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:54:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-17 05:54:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 789. [2025-03-17 05:54:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 695 states have (on average 1.3697841726618705) internal successors, (952), 698 states have internal predecessors, (952), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1120 transitions. [2025-03-17 05:54:26,479 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1120 transitions. Word has length 115 [2025-03-17 05:54:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:26,479 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1120 transitions. [2025-03-17 05:54:26,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1120 transitions. [2025-03-17 05:54:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:54:26,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:26,481 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:26,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:54:26,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:26,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash -13966765, now seen corresponding path program 1 times [2025-03-17 05:54:26,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:26,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311187944] [2025-03-17 05:54:26,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:26,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:54:26,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:54:26,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:26,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:27,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311187944] [2025-03-17 05:54:27,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311187944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:27,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:27,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:54:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11013155] [2025-03-17 05:54:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:27,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:54:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:27,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:54:27,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:54:27,647 INFO L87 Difference]: Start difference. First operand 789 states and 1120 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:29,416 INFO L93 Difference]: Finished difference Result 1742 states and 2471 transitions. [2025-03-17 05:54:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:54:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-17 05:54:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:29,420 INFO L225 Difference]: With dead ends: 1742 [2025-03-17 05:54:29,420 INFO L226 Difference]: Without dead ends: 954 [2025-03-17 05:54:29,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:54:29,422 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 333 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:29,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1182 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 05:54:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-03-17 05:54:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 799. [2025-03-17 05:54:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 705 states have (on average 1.3673758865248227) internal successors, (964), 708 states have internal predecessors, (964), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1132 transitions. [2025-03-17 05:54:29,458 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1132 transitions. Word has length 115 [2025-03-17 05:54:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:29,459 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1132 transitions. [2025-03-17 05:54:29,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:54:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1132 transitions. [2025-03-17 05:54:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:54:29,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:29,460 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:29,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:54:29,460 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:29,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash -292471353, now seen corresponding path program 1 times [2025-03-17 05:54:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260146069] [2025-03-17 05:54:29,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:29,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:54:29,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:54:29,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:29,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:30,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260146069] [2025-03-17 05:54:30,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260146069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:30,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:30,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:54:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379082355] [2025-03-17 05:54:30,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:30,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:54:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:30,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:54:30,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:30,152 INFO L87 Difference]: Start difference. First operand 799 states and 1132 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:30,751 INFO L93 Difference]: Finished difference Result 1705 states and 2411 transitions. [2025-03-17 05:54:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:54:30,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-17 05:54:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:30,755 INFO L225 Difference]: With dead ends: 1705 [2025-03-17 05:54:30,755 INFO L226 Difference]: Without dead ends: 907 [2025-03-17 05:54:30,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:54:30,757 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 330 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:30,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 490 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:54:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-03-17 05:54:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 809. [2025-03-17 05:54:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 715 states have (on average 1.3678321678321679) internal successors, (978), 718 states have internal predecessors, (978), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1146 transitions. [2025-03-17 05:54:30,788 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1146 transitions. Word has length 116 [2025-03-17 05:54:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:30,788 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1146 transitions. [2025-03-17 05:54:30,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1146 transitions. [2025-03-17 05:54:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:54:30,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:30,790 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:54:30,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:30,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash 400630344, now seen corresponding path program 1 times [2025-03-17 05:54:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:30,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248417939] [2025-03-17 05:54:30,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:30,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:30,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:54:30,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:54:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248417939] [2025-03-17 05:54:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248417939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:31,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:54:31,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713449781] [2025-03-17 05:54:31,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:31,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:54:31,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:31,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:54:31,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:54:31,843 INFO L87 Difference]: Start difference. First operand 809 states and 1146 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:33,372 INFO L93 Difference]: Finished difference Result 1767 states and 2501 transitions. [2025-03-17 05:54:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:54:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-17 05:54:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:33,378 INFO L225 Difference]: With dead ends: 1767 [2025-03-17 05:54:33,378 INFO L226 Difference]: Without dead ends: 959 [2025-03-17 05:54:33,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:54:33,380 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 369 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:33,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1100 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:54:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-17 05:54:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 799. [2025-03-17 05:54:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 705 states have (on average 1.3659574468085107) internal successors, (963), 708 states have internal predecessors, (963), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1131 transitions. [2025-03-17 05:54:33,418 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1131 transitions. Word has length 116 [2025-03-17 05:54:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:33,418 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1131 transitions. [2025-03-17 05:54:33,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:54:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1131 transitions. [2025-03-17 05:54:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:54:33,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:33,420 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:33,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:54:33,420 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:33,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1117999987, now seen corresponding path program 1 times [2025-03-17 05:54:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479366824] [2025-03-17 05:54:33,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:33,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:33,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:54:33,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:54:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:34,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:34,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479366824] [2025-03-17 05:54:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479366824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:34,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:34,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:54:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960621158] [2025-03-17 05:54:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:34,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:54:34,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:34,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:54:34,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:54:34,710 INFO L87 Difference]: Start difference. First operand 799 states and 1131 transitions. Second operand has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 15 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:54:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:38,563 INFO L93 Difference]: Finished difference Result 2042 states and 2871 transitions. [2025-03-17 05:54:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:54:38,564 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 15 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 117 [2025-03-17 05:54:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:38,569 INFO L225 Difference]: With dead ends: 2042 [2025-03-17 05:54:38,569 INFO L226 Difference]: Without dead ends: 1511 [2025-03-17 05:54:38,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:54:38,571 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1206 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:38,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 2102 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-17 05:54:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-17 05:54:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 841. [2025-03-17 05:54:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 747 states have (on average 1.3627844712182062) internal successors, (1018), 750 states have internal predecessors, (1018), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:54:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1186 transitions. [2025-03-17 05:54:38,610 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1186 transitions. Word has length 117 [2025-03-17 05:54:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:38,610 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1186 transitions. [2025-03-17 05:54:38,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 15 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:54:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1186 transitions. [2025-03-17 05:54:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:54:38,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:38,611 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:38,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:54:38,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1086980180, now seen corresponding path program 1 times [2025-03-17 05:54:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:38,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845986057] [2025-03-17 05:54:38,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:38,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:54:38,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:54:38,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:38,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:55,404 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:54:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:54:55,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845986057] [2025-03-17 05:54:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845986057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:55,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:55,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:54:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49193978] [2025-03-17 05:54:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:55,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:54:55,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:55,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:54:55,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:54:55,589 INFO L87 Difference]: Start difference. First operand 841 states and 1186 transitions. Second operand has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:55:04,199 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:55:12,287 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:55:20,599 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:55:29,906 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:55:38,054 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:55:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:38,994 INFO L93 Difference]: Finished difference Result 1733 states and 2447 transitions. [2025-03-17 05:55:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:55:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 117 [2025-03-17 05:55:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:39,001 INFO L225 Difference]: With dead ends: 1733 [2025-03-17 05:55:39,001 INFO L226 Difference]: Without dead ends: 1160 [2025-03-17 05:55:39,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:55:39,003 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 303 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:39,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1524 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 05:55:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-03-17 05:55:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 811. [2025-03-17 05:55:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 717 states have (on average 1.3626220362622037) internal successors, (977), 720 states have internal predecessors, (977), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:55:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1145 transitions. [2025-03-17 05:55:39,072 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1145 transitions. Word has length 117 [2025-03-17 05:55:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:39,072 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1145 transitions. [2025-03-17 05:55:39,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:55:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1145 transitions. [2025-03-17 05:55:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:55:39,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:39,074 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:39,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:55:39,074 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:39,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash 322664949, now seen corresponding path program 1 times [2025-03-17 05:55:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826428376] [2025-03-17 05:55:39,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:39,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:55:39,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:55:39,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:39,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:55:39,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:39,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826428376] [2025-03-17 05:55:39,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826428376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:39,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:39,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:55:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267455899] [2025-03-17 05:55:39,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:39,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:55:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:39,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:55:39,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:55:39,538 INFO L87 Difference]: Start difference. First operand 811 states and 1145 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:55:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:39,916 INFO L93 Difference]: Finished difference Result 1757 states and 2463 transitions. [2025-03-17 05:55:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:55:39,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-03-17 05:55:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:39,920 INFO L225 Difference]: With dead ends: 1757 [2025-03-17 05:55:39,921 INFO L226 Difference]: Without dead ends: 947 [2025-03-17 05:55:39,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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 05:55:39,923 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 56 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:39,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 504 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:55:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-17 05:55:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 942. [2025-03-17 05:55:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 836 states have (on average 1.3504784688995215) internal successors, (1129), 842 states have internal predecessors, (1129), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-17 05:55:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1309 transitions. [2025-03-17 05:55:39,966 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1309 transitions. Word has length 117 [2025-03-17 05:55:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:39,966 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1309 transitions. [2025-03-17 05:55:39,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:55:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1309 transitions. [2025-03-17 05:55:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:55:39,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:39,967 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:39,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:55:39,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:39,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash 29261942, now seen corresponding path program 1 times [2025-03-17 05:55:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601020600] [2025-03-17 05:55:39,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:39,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:55:39,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:55:39,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:39,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:55:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601020600] [2025-03-17 05:55:40,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601020600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:55:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157502879] [2025-03-17 05:55:40,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:40,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:55:40,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:55:40,133 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 05:55:40,134 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 05:55:40,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:55:40,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:55:40,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:40,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:40,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:55:40,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:55:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:55:40,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:55:40,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157502879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:40,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:55:40,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-03-17 05:55:40,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627936337] [2025-03-17 05:55:40,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:40,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:55:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:40,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:55:40,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:55:40,429 INFO L87 Difference]: Start difference. First operand 942 states and 1309 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:55:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:40,526 INFO L93 Difference]: Finished difference Result 1906 states and 2646 transitions. [2025-03-17 05:55:40,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:55:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-17 05:55:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:40,530 INFO L225 Difference]: With dead ends: 1906 [2025-03-17 05:55:40,530 INFO L226 Difference]: Without dead ends: 965 [2025-03-17 05:55:40,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:55:40,531 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:40,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 736 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:55:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-03-17 05:55:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 954. [2025-03-17 05:55:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 848 states have (on average 1.3396226415094339) internal successors, (1136), 854 states have internal predecessors, (1136), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-17 05:55:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1316 transitions. [2025-03-17 05:55:40,575 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1316 transitions. Word has length 117 [2025-03-17 05:55:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:40,575 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1316 transitions. [2025-03-17 05:55:40,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:55:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1316 transitions. [2025-03-17 05:55:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:55:40,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:40,576 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:40,584 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 05:55:40,777 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,SelfDestructingSolverStorable17 [2025-03-17 05:55:40,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:40,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1934246058, now seen corresponding path program 1 times [2025-03-17 05:55:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:40,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593040241] [2025-03-17 05:55:40,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:40,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:55:40,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:55:40,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:40,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:55:40,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:40,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593040241] [2025-03-17 05:55:40,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593040241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:40,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:40,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:55:40,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282390990] [2025-03-17 05:55:40,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:40,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:55:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:40,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:55:40,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:55:40,992 INFO L87 Difference]: Start difference. First operand 954 states and 1316 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:55:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:41,304 INFO L93 Difference]: Finished difference Result 1927 states and 2652 transitions. [2025-03-17 05:55:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:55:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-17 05:55:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:41,308 INFO L225 Difference]: With dead ends: 1927 [2025-03-17 05:55:41,309 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 05:55:41,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:55:41,311 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 65 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:41,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 962 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:55:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 05:55:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 948. [2025-03-17 05:55:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 842 states have (on average 1.340855106888361) internal successors, (1129), 848 states have internal predecessors, (1129), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-17 05:55:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1309 transitions. [2025-03-17 05:55:41,381 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1309 transitions. Word has length 117 [2025-03-17 05:55:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:41,381 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1309 transitions. [2025-03-17 05:55:41,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:55:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1309 transitions. [2025-03-17 05:55:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:55:41,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:41,385 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:41,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:55:41,389 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:41,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1482747156, now seen corresponding path program 1 times [2025-03-17 05:55:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:41,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919044980] [2025-03-17 05:55:41,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:41,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:55:41,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:55:41,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:41,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat