./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.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-sp_file-70.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 d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:12:08,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:12:08,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:12:08,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:12:08,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:12:08,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:12:08,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:12:08,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:12:08,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:12:08,191 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:12:08,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:12:08,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:12:08,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:12:08,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:12:08,191 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:12:08,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:12:08,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:12:08,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:08,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:12:08,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:12:08,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:12:08,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:12:08,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:12:08,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:12:08,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:12:08,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:12:08,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:12:08,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:12:08,193 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 -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2025-03-17 06:12:08,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:12:08,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:12:08,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:12:08,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:12:08,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:12:08,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2025-03-17 06:12:09,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96793a60e/86bab2b3fa5347d1b042930cb5535122/FLAGe68f8f24d [2025-03-17 06:12:10,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:12:10,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2025-03-17 06:12:10,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96793a60e/86bab2b3fa5347d1b042930cb5535122/FLAGe68f8f24d [2025-03-17 06:12:10,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96793a60e/86bab2b3fa5347d1b042930cb5535122 [2025-03-17 06:12:10,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:12:10,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:12:10,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:10,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:12:10,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:12:10,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f965e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10, skipping insertion in model container [2025-03-17 06:12:10,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:12:10,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2025-03-17 06:12:10,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:10,337 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:12:10,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2025-03-17 06:12:10,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:10,417 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:12:10,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10 WrapperNode [2025-03-17 06:12:10,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:10,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:10,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:12:10,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:12:10,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,478 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2025-03-17 06:12:10,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:10,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:12:10,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:12:10,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:12:10,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,510 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:12:10,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:12:10,538 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:12:10,538 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:12:10,538 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:12:10,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:10,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:10,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:12:10,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:12:10,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:12:10,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:12:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:12:10,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:12:10,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:12:10,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:12:11,237 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem88#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~short103#1;havoc property_#t~mem113#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise106#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~bitwise111#1;havoc property_#t~ite126#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite137#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-03-17 06:12:11,302 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2025-03-17 06:12:11,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:12:11,319 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:12:11,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:12:11,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:11 BoogieIcfgContainer [2025-03-17 06:12:11,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:12:11,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:12:11,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:12:11,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:12:11,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:12:10" (1/3) ... [2025-03-17 06:12:11,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674c8d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:11, skipping insertion in model container [2025-03-17 06:12:11,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (2/3) ... [2025-03-17 06:12:11,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674c8d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:11, skipping insertion in model container [2025-03-17 06:12:11,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:11" (3/3) ... [2025-03-17 06:12:11,332 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2025-03-17 06:12:11,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:12:11,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-70.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:12:11,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:12:11,405 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;@24ffc20e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:12:11,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:12:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 91 states have internal predecessors, (131), 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 06:12:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:12:11,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:11,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] [2025-03-17 06:12:11,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -692969770, now seen corresponding path program 1 times [2025-03-17 06:12:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609705243] [2025-03-17 06:12:11,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:11,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:12:11,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:12:11,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:11,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:11,801 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 06:12:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:11,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609705243] [2025-03-17 06:12:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609705243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:11,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30693571] [2025-03-17 06:12:11,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:11,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:11,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:11,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:12:11,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:12:12,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:12:12,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:12,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:12,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:12:12,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:12,061 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 06:12:12,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30693571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:12,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:12,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:12:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026098848] [2025-03-17 06:12:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:12,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:12:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:12,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:12:12,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:12,087 INFO L87 Difference]: Start difference. First operand has 105 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 91 states have internal predecessors, (131), 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.5) internal successors, (57), 2 states have internal predecessors, (57), 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 06:12:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:12,115 INFO L93 Difference]: Finished difference Result 207 states and 320 transitions. [2025-03-17 06:12:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:12:12,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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 112 [2025-03-17 06:12:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:12,120 INFO L225 Difference]: With dead ends: 207 [2025-03-17 06:12:12,120 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 06:12:12,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:12,129 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:12,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 06:12:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 06:12:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 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 06:12:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-03-17 06:12:12,160 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 112 [2025-03-17 06:12:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:12,161 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-03-17 06:12:12,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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 06:12:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-03-17 06:12:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:12:12,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:12,168 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 06:12:12,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:12:12,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:12:12,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1556111218, now seen corresponding path program 1 times [2025-03-17 06:12:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060900902] [2025-03-17 06:12:12,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:12,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:12:12,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:12:12,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:12,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:12,836 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 06:12:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060900902] [2025-03-17 06:12:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060900902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154219178] [2025-03-17 06:12:12,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:12,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:12,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:12,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:12,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:12:12,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:12:13,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:12:13,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:13,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:13,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:12:13,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:13,109 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 06:12:13,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:13,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154219178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:13,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:12:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913310788] [2025-03-17 06:12:13,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:13,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:13,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:13,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:13,114 INFO L87 Difference]: Start difference. First operand 103 states and 151 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 06:12:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:13,173 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2025-03-17 06:12:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:13,174 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 06:12:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:13,176 INFO L225 Difference]: With dead ends: 208 [2025-03-17 06:12:13,177 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 06:12:13,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:13,179 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:13,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 421 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 06:12:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 06:12:13,193 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 06:12:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-17 06:12:13,195 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 112 [2025-03-17 06:12:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:13,196 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-17 06:12:13,197 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 06:12:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-17 06:12:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:12:13,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:13,198 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 06:12:13,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:12:13,400 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,SelfDestructingSolverStorable1 [2025-03-17 06:12:13,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:13,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash -668607537, now seen corresponding path program 1 times [2025-03-17 06:12:13,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:13,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306953687] [2025-03-17 06:12:13,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:13,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:12:13,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:12:13,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:13,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:13,679 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 06:12:13,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:13,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306953687] [2025-03-17 06:12:13,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306953687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:13,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197081245] [2025-03-17 06:12:13,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:13,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:13,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:13,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:13,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:12:13,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:12:13,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:12:13,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:13,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:13,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:12:13,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:13,992 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 06:12:13,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:13,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197081245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:13,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:13,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:12:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199072854] [2025-03-17 06:12:13,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:13,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:13,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:13,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:13,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:13,995 INFO L87 Difference]: Start difference. First operand 105 states and 153 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 06:12:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:14,038 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2025-03-17 06:12:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:14,042 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 06:12:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:14,043 INFO L225 Difference]: With dead ends: 212 [2025-03-17 06:12:14,043 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 06:12:14,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:14,044 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:14,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 06:12:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-17 06:12:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 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 06:12:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-17 06:12:14,057 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 112 [2025-03-17 06:12:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:14,057 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-17 06:12:14,058 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 06:12:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-17 06:12:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:12:14,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:14,061 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 06:12:14,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:12:14,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:14,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:14,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash -667684016, now seen corresponding path program 1 times [2025-03-17 06:12:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:14,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975986981] [2025-03-17 06:12:14,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:14,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:12:14,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:12:14,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:14,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:14,548 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 06:12:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975986981] [2025-03-17 06:12:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975986981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561777486] [2025-03-17 06:12:14,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:14,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:14,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:14,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:14,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:12:14,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:12:14,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:12:14,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:14,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:14,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:12:14,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:14,844 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 06:12:14,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561777486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:12:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29035011] [2025-03-17 06:12:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:14,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:14,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:12:14,847 INFO L87 Difference]: Start difference. First operand 107 states and 155 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 06:12:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:14,893 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2025-03-17 06:12:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:14,895 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 06:12:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:14,896 INFO L225 Difference]: With dead ends: 215 [2025-03-17 06:12:14,896 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 06:12:14,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:12:14,897 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:14,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 06:12:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 06:12:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 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 06:12:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-17 06:12:14,910 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-03-17 06:12:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:14,911 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-17 06:12:14,912 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 06:12:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-17 06:12:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 06:12:14,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:14,913 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 06:12:14,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 06:12:15,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:15,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:15,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1895088338, now seen corresponding path program 1 times [2025-03-17 06:12:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:15,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898188720] [2025-03-17 06:12:15,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:15,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 06:12:15,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 06:12:15,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:15,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:15,562 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 06:12:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898188720] [2025-03-17 06:12:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898188720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:15,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:15,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:12:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909462036] [2025-03-17 06:12:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:15,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:12:15,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:15,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:12:15,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:12:15,563 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 06:12:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:15,746 INFO L93 Difference]: Finished difference Result 232 states and 336 transitions. [2025-03-17 06:12:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:15,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 06:12:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:15,749 INFO L225 Difference]: With dead ends: 232 [2025-03-17 06:12:15,749 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 06:12:15,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:12:15,750 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 17 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:15,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 456 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:12:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 06:12:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2025-03-17 06:12:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 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 06:12:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-03-17 06:12:15,764 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 114 [2025-03-17 06:12:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:15,764 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-03-17 06:12:15,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 06:12:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-03-17 06:12:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 06:12:15,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:15,768 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 06:12:15,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:12:15,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash 353689422, now seen corresponding path program 1 times [2025-03-17 06:12:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:15,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030123796] [2025-03-17 06:12:15,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:15,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 06:12:15,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 06:12:15,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:15,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:16,086 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 06:12:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:16,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030123796] [2025-03-17 06:12:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030123796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:12:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48117435] [2025-03-17 06:12:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:16,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:16,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:16,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:16,090 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (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 06:12:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:16,304 INFO L93 Difference]: Finished difference Result 223 states and 319 transitions. [2025-03-17 06:12:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:16,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (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 06:12:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:16,306 INFO L225 Difference]: With dead ends: 223 [2025-03-17 06:12:16,306 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 06:12:16,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:16,307 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:16,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:12:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 06:12:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 06:12:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 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 06:12:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2025-03-17 06:12:16,318 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 114 [2025-03-17 06:12:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:16,319 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2025-03-17 06:12:16,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (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 06:12:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2025-03-17 06:12:16,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 06:12:16,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:16,320 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 06:12:16,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:12:16,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:16,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1487520361, now seen corresponding path program 1 times [2025-03-17 06:12:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:16,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957650917] [2025-03-17 06:12:16,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:16,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 06:12:16,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 06:12:16,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:16,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:16,540 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 06:12:16,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:16,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957650917] [2025-03-17 06:12:16,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957650917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:16,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:16,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:12:16,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195765098] [2025-03-17 06:12:16,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:16,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:12:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:16,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:12:16,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:12:16,546 INFO L87 Difference]: Start difference. First operand 112 states and 159 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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 06:12:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:16,568 INFO L93 Difference]: Finished difference Result 223 states and 317 transitions. [2025-03-17 06:12:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:12:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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 06:12:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:16,571 INFO L225 Difference]: With dead ends: 223 [2025-03-17 06:12:16,571 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 06:12:16,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:12:16,572 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:16,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 06:12:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 06:12:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 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 06:12:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2025-03-17 06:12:16,586 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 116 [2025-03-17 06:12:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:16,586 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2025-03-17 06:12:16,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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 06:12:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2025-03-17 06:12:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 06:12:16,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:16,592 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 06:12:16,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:12:16,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 643048490, now seen corresponding path program 1 times [2025-03-17 06:12:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059478471] [2025-03-17 06:12:16,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:16,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 06:12:16,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 06:12:16,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:16,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:17,315 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 06:12:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:17,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059478471] [2025-03-17 06:12:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059478471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:17,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759716810] [2025-03-17 06:12:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:17,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:17,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:17,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:17,317 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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 06:12:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:17,798 INFO L93 Difference]: Finished difference Result 274 states and 383 transitions. [2025-03-17 06:12:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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 06:12:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:17,801 INFO L225 Difference]: With dead ends: 274 [2025-03-17 06:12:17,801 INFO L226 Difference]: Without dead ends: 163 [2025-03-17 06:12:17,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:17,802 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 163 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:17,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 512 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-17 06:12:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 127. [2025-03-17 06:12:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 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 06:12:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2025-03-17 06:12:17,812 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 116 [2025-03-17 06:12:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:17,812 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2025-03-17 06:12:17,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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 06:12:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2025-03-17 06:12:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:12:17,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:17,814 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 06:12:17,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:12:17,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:17,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash 38006929, now seen corresponding path program 1 times [2025-03-17 06:12:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064404003] [2025-03-17 06:12:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:17,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:12:17,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:12:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:18,029 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 06:12:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064404003] [2025-03-17 06:12:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064404003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:18,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:18,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:12:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575849187] [2025-03-17 06:12:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:12:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:18,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:12:18,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:12:18,032 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 06:12:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:18,210 INFO L93 Difference]: Finished difference Result 288 states and 401 transitions. [2025-03-17 06:12:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 06:12:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:18,211 INFO L225 Difference]: With dead ends: 288 [2025-03-17 06:12:18,212 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 06:12:18,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:12:18,212 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 41 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:18,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 445 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:12:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 06:12:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 129. [2025-03-17 06:12:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 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 06:12:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2025-03-17 06:12:18,221 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 117 [2025-03-17 06:12:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:18,222 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2025-03-17 06:12:18,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 06:12:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2025-03-17 06:12:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:12:18,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:18,223 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 06:12:18,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:12:18,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:18,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1040000113, now seen corresponding path program 1 times [2025-03-17 06:12:18,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:18,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125964195] [2025-03-17 06:12:18,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:18,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:12:18,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:12:18,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:18,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:18,408 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 06:12:18,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:18,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125964195] [2025-03-17 06:12:18,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125964195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659262224] [2025-03-17 06:12:18,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:18,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:18,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:18,411 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:18,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:12:18,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:12:18,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:12:18,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:18,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:18,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:12:18,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:18,628 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 06:12:18,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659262224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:18,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 06:12:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693842618] [2025-03-17 06:12:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:18,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:12:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:18,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:12:18,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:18,633 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 06:12:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:18,665 INFO L93 Difference]: Finished difference Result 260 states and 361 transitions. [2025-03-17 06:12:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:12:18,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 06:12:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:18,667 INFO L225 Difference]: With dead ends: 260 [2025-03-17 06:12:18,667 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 06:12:18,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:18,667 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:18,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 06:12:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-17 06:12:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 118 states have internal predecessors, (158), 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 06:12:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2025-03-17 06:12:18,675 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 117 [2025-03-17 06:12:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:18,676 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2025-03-17 06:12:18,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 06:12:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2025-03-17 06:12:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 06:12:18,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:18,677 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 06:12:18,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:12:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 06:12:18,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1973551732, now seen corresponding path program 1 times [2025-03-17 06:12:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51509664] [2025-03-17 06:12:18,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:18,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 06:12:19,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 06:12:19,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:19,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:21,313 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 06:12:21,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51509664] [2025-03-17 06:12:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51509664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:21,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:21,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:12:21,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762920126] [2025-03-17 06:12:21,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:12:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:21,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:12:21,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:21,315 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 06:12:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:22,626 INFO L93 Difference]: Finished difference Result 330 states and 452 transitions. [2025-03-17 06:12:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:12:22,627 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 118 [2025-03-17 06:12:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:22,628 INFO L225 Difference]: With dead ends: 330 [2025-03-17 06:12:22,628 INFO L226 Difference]: Without dead ends: 199 [2025-03-17 06:12:22,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:12:22,629 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 277 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:22,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 903 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:12:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-17 06:12:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2025-03-17 06:12:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 141 states have internal predecessors, (189), 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 06:12:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2025-03-17 06:12:22,636 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 118 [2025-03-17 06:12:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:22,636 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2025-03-17 06:12:22,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 06:12:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2025-03-17 06:12:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 06:12:22,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:22,637 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 06:12:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:12:22,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1810881387, now seen corresponding path program 1 times [2025-03-17 06:12:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977377677] [2025-03-17 06:12:22,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:22,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 06:12:22,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 06:12:22,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:22,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:23,813 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 06:12:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:23,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977377677] [2025-03-17 06:12:23,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977377677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:23,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:23,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:12:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037470746] [2025-03-17 06:12:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:23,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:12:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:23,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:12:23,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:23,815 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 06:12:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:25,026 INFO L93 Difference]: Finished difference Result 368 states and 502 transitions. [2025-03-17 06:12:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:12:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 118 [2025-03-17 06:12:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:25,029 INFO L225 Difference]: With dead ends: 368 [2025-03-17 06:12:25,029 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 06:12:25,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:12:25,030 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 305 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:25,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1017 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:12:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 06:12:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 170. [2025-03-17 06:12:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.3397435897435896) internal successors, (209), 156 states have internal predecessors, (209), 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 06:12:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2025-03-17 06:12:25,041 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 118 [2025-03-17 06:12:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:25,041 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2025-03-17 06:12:25,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 06:12:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2025-03-17 06:12:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 06:12:25,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:25,043 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 06:12:25,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:12:25,043 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1522471892, now seen corresponding path program 1 times [2025-03-17 06:12:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522409187] [2025-03-17 06:12:25,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:25,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 06:12:25,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 06:12:25,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:25,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:26,942 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 06:12:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522409187] [2025-03-17 06:12:26,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522409187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:26,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:26,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:12:26,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815691035] [2025-03-17 06:12:26,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:26,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:12:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:26,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:12:26,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:26,943 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 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 06:12:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:28,007 INFO L93 Difference]: Finished difference Result 391 states and 530 transitions. [2025-03-17 06:12:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:12:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 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 118 [2025-03-17 06:12:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:28,011 INFO L225 Difference]: With dead ends: 391 [2025-03-17 06:12:28,012 INFO L226 Difference]: Without dead ends: 222 [2025-03-17 06:12:28,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:12:28,013 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 246 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:28,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 661 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:12:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-17 06:12:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2025-03-17 06:12:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 202 states have (on average 1.3217821782178218) internal successors, (267), 203 states have internal predecessors, (267), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 295 transitions. [2025-03-17 06:12:28,041 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 295 transitions. Word has length 118 [2025-03-17 06:12:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:28,044 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 295 transitions. [2025-03-17 06:12:28,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 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 06:12:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 295 transitions. [2025-03-17 06:12:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 06:12:28,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:28,046 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 06:12:28,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:12:28,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:28,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1622751795, now seen corresponding path program 1 times [2025-03-17 06:12:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752150796] [2025-03-17 06:12:28,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:28,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 06:12:28,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 06:12:28,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:28,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:29,608 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 06:12:29,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:29,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752150796] [2025-03-17 06:12:29,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752150796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:29,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:29,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:12:29,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484630447] [2025-03-17 06:12:29,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:29,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:12:29,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:29,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:12:29,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:29,613 INFO L87 Difference]: Start difference. First operand 219 states and 295 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 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 06:12:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:30,513 INFO L93 Difference]: Finished difference Result 437 states and 589 transitions. [2025-03-17 06:12:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:12:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 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 118 [2025-03-17 06:12:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:30,516 INFO L225 Difference]: With dead ends: 437 [2025-03-17 06:12:30,516 INFO L226 Difference]: Without dead ends: 219 [2025-03-17 06:12:30,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:12:30,518 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 130 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:30,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 518 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:12:30,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-17 06:12:30,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2025-03-17 06:12:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 201 states have (on average 1.318407960199005) internal successors, (265), 202 states have internal predecessors, (265), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 293 transitions. [2025-03-17 06:12:30,544 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 293 transitions. Word has length 118 [2025-03-17 06:12:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:30,544 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 293 transitions. [2025-03-17 06:12:30,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 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 06:12:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 293 transitions. [2025-03-17 06:12:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 06:12:30,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:30,546 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 06:12:30,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:12:30,546 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -661137778, now seen corresponding path program 1 times [2025-03-17 06:12:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302206442] [2025-03-17 06:12:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:30,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 06:12:30,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 06:12:30,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:30,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:32,164 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 06:12:32,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:32,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302206442] [2025-03-17 06:12:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302206442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:32,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:12:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788337781] [2025-03-17 06:12:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:32,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:12:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:32,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:12:32,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:32,165 INFO L87 Difference]: Start difference. First operand 218 states and 293 transitions. Second operand has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 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 06:12:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:32,830 INFO L93 Difference]: Finished difference Result 484 states and 647 transitions. [2025-03-17 06:12:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:12:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 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 118 [2025-03-17 06:12:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:32,834 INFO L225 Difference]: With dead ends: 484 [2025-03-17 06:12:32,834 INFO L226 Difference]: Without dead ends: 267 [2025-03-17 06:12:32,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:12:32,835 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 301 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:32,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 629 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:12:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-17 06:12:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 218. [2025-03-17 06:12:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 292 transitions. [2025-03-17 06:12:32,855 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 292 transitions. Word has length 118 [2025-03-17 06:12:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:32,855 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 292 transitions. [2025-03-17 06:12:32,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 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 06:12:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2025-03-17 06:12:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 06:12:32,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:32,856 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 06:12:32,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:12:32,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:32,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1171671955, now seen corresponding path program 1 times [2025-03-17 06:12:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:32,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235618329] [2025-03-17 06:12:32,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:32,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 06:12:32,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 06:12:32,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:32,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:35,203 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 06:12:35,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235618329] [2025-03-17 06:12:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235618329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 06:12:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46501218] [2025-03-17 06:12:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:35,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:12:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:35,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:12:35,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:12:35,205 INFO L87 Difference]: Start difference. First operand 218 states and 292 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:37,561 INFO L93 Difference]: Finished difference Result 532 states and 709 transitions. [2025-03-17 06:12:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:12:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2025-03-17 06:12:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:37,563 INFO L225 Difference]: With dead ends: 532 [2025-03-17 06:12:37,563 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 06:12:37,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2025-03-17 06:12:37,565 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 394 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:37,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 986 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 06:12:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 06:12:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 230. [2025-03-17 06:12:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 213 states have (on average 1.3145539906103287) internal successors, (280), 214 states have internal predecessors, (280), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 308 transitions. [2025-03-17 06:12:37,587 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 308 transitions. Word has length 118 [2025-03-17 06:12:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:37,587 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 308 transitions. [2025-03-17 06:12:37,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 308 transitions. [2025-03-17 06:12:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:12:37,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:37,590 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, 1] [2025-03-17 06:12:37,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:12:37,591 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1977203032, now seen corresponding path program 1 times [2025-03-17 06:12:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390339025] [2025-03-17 06:12:37,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:37,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:37,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:12:37,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:12:37,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:37,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:37,799 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 06:12:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390339025] [2025-03-17 06:12:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390339025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:37,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:37,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:12:37,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995073292] [2025-03-17 06:12:37,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:12:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:37,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:12:37,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:12:37,801 INFO L87 Difference]: Start difference. First operand 230 states and 308 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (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 06:12:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:38,038 INFO L93 Difference]: Finished difference Result 481 states and 646 transitions. [2025-03-17 06:12:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:38,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (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 119 [2025-03-17 06:12:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:38,040 INFO L225 Difference]: With dead ends: 481 [2025-03-17 06:12:38,040 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 06:12:38,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:12:38,041 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 6 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:38,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 434 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:12:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 06:12:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 236. [2025-03-17 06:12:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 219 states have (on average 1.3013698630136987) internal successors, (285), 220 states have internal predecessors, (285), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 313 transitions. [2025-03-17 06:12:38,058 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 313 transitions. Word has length 119 [2025-03-17 06:12:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:38,058 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 313 transitions. [2025-03-17 06:12:38,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (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 06:12:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 313 transitions. [2025-03-17 06:12:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 06:12:38,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:38,059 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, 1, 1] [2025-03-17 06:12:38,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:12:38,059 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:38,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash 163260372, now seen corresponding path program 1 times [2025-03-17 06:12:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:38,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244326283] [2025-03-17 06:12:38,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:38,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 06:12:38,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 06:12:38,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:38,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:43,525 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 06:12:43,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:43,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244326283] [2025-03-17 06:12:43,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244326283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:43,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-17 06:12:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415864979] [2025-03-17 06:12:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 06:12:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:43,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 06:12:43,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:12:43,526 INFO L87 Difference]: Start difference. First operand 236 states and 313 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:12:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:50,759 INFO L93 Difference]: Finished difference Result 515 states and 681 transitions. [2025-03-17 06:12:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:12:50,762 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 120 [2025-03-17 06:12:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:50,764 INFO L225 Difference]: With dead ends: 515 [2025-03-17 06:12:50,764 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 06:12:50,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 06:12:50,766 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 354 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:50,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1183 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-17 06:12:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 06:12:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 223. [2025-03-17 06:12:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 207 states have internal predecessors, (268), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 296 transitions. [2025-03-17 06:12:50,788 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 296 transitions. Word has length 120 [2025-03-17 06:12:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:50,789 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 296 transitions. [2025-03-17 06:12:50,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:12:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 296 transitions. [2025-03-17 06:12:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:12:50,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:50,791 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, 1, 1, 1] [2025-03-17 06:12:50,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 06:12:50,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -626183599, now seen corresponding path program 1 times [2025-03-17 06:12:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113749294] [2025-03-17 06:12:50,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:12:50,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:12:50,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:50,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:51,309 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 06:12:51,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:51,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113749294] [2025-03-17 06:12:51,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113749294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:51,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:51,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72799764] [2025-03-17 06:12:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:51,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:12:51,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:51,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:12:51,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:51,310 INFO L87 Difference]: Start difference. First operand 223 states and 296 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 06:12:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:51,767 INFO L93 Difference]: Finished difference Result 481 states and 636 transitions. [2025-03-17 06:12:51,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:12:51,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 121 [2025-03-17 06:12:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:51,769 INFO L225 Difference]: With dead ends: 481 [2025-03-17 06:12:51,769 INFO L226 Difference]: Without dead ends: 259 [2025-03-17 06:12:51,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:12:51,771 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 221 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:51,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 897 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-17 06:12:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 220. [2025-03-17 06:12:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 203 states have (on average 1.3004926108374384) internal successors, (264), 204 states have internal predecessors, (264), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 292 transitions. [2025-03-17 06:12:51,794 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 292 transitions. Word has length 121 [2025-03-17 06:12:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:51,795 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 292 transitions. [2025-03-17 06:12:51,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 06:12:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 292 transitions. [2025-03-17 06:12:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:12:51,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:51,796 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, 1, 1, 1] [2025-03-17 06:12:51,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 06:12:51,797 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:51,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash -614867472, now seen corresponding path program 1 times [2025-03-17 06:12:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:51,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850008304] [2025-03-17 06:12:51,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:51,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:51,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:12:51,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:12:51,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:51,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:54,785 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 06:12:54,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:54,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850008304] [2025-03-17 06:12:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850008304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 06:12:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730632903] [2025-03-17 06:12:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:54,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:12:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:54,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:12:54,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:12:54,787 INFO L87 Difference]: Start difference. First operand 220 states and 292 transitions. Second operand has 19 states, 17 states have (on average 3.764705882352941) internal successors, (64), 19 states have internal predecessors, (64), 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 06:12:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:57,738 INFO L93 Difference]: Finished difference Result 541 states and 713 transitions. [2025-03-17 06:12:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:12:57,739 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.764705882352941) internal successors, (64), 19 states have internal predecessors, (64), 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 121 [2025-03-17 06:12:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:57,741 INFO L225 Difference]: With dead ends: 541 [2025-03-17 06:12:57,741 INFO L226 Difference]: Without dead ends: 322 [2025-03-17 06:12:57,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2025-03-17 06:12:57,743 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 525 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:57,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1031 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 06:12:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-17 06:12:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 241. [2025-03-17 06:12:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 224 states have (on average 1.2991071428571428) internal successors, (291), 225 states have internal predecessors, (291), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 319 transitions. [2025-03-17 06:12:57,768 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 319 transitions. Word has length 121 [2025-03-17 06:12:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:57,768 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 319 transitions. [2025-03-17 06:12:57,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.764705882352941) internal successors, (64), 19 states have internal predecessors, (64), 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 06:12:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 319 transitions. [2025-03-17 06:12:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:12:57,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:57,769 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, 1, 1, 1] [2025-03-17 06:12:57,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 06:12:57,770 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:57,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash -264067535, now seen corresponding path program 1 times [2025-03-17 06:12:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408697330] [2025-03-17 06:12:57,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:57,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:12:57,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:12:57,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:57,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:58,204 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 06:12:58,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:58,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408697330] [2025-03-17 06:12:58,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408697330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:58,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:58,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52314553] [2025-03-17 06:12:58,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:58,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:58,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:58,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:58,207 INFO L87 Difference]: Start difference. First operand 241 states and 319 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 06:12:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:58,571 INFO L93 Difference]: Finished difference Result 567 states and 747 transitions. [2025-03-17 06:12:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 121 [2025-03-17 06:12:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:58,577 INFO L225 Difference]: With dead ends: 567 [2025-03-17 06:12:58,577 INFO L226 Difference]: Without dead ends: 327 [2025-03-17 06:12:58,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:58,579 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 205 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:58,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 469 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-17 06:12:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 240. [2025-03-17 06:12:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 223 states have (on average 1.295964125560538) internal successors, (289), 224 states have internal predecessors, (289), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:12:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2025-03-17 06:12:58,627 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 121 [2025-03-17 06:12:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:58,628 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2025-03-17 06:12:58,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 06:12:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2025-03-17 06:12:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:12:58,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:58,630 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, 1, 1, 1] [2025-03-17 06:12:58,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:12:58,631 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:58,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash -433847344, now seen corresponding path program 1 times [2025-03-17 06:12:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:58,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048440747] [2025-03-17 06:12:58,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:58,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:58,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:12:58,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:12:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:00,635 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 06:13:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:00,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048440747] [2025-03-17 06:13:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048440747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:13:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131126771] [2025-03-17 06:13:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:00,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:13:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:00,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:13:00,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:13:00,637 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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 06:13:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:02,441 INFO L93 Difference]: Finished difference Result 612 states and 799 transitions. [2025-03-17 06:13:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 06:13:02,444 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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 121 [2025-03-17 06:13:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:02,445 INFO L225 Difference]: With dead ends: 612 [2025-03-17 06:13:02,445 INFO L226 Difference]: Without dead ends: 373 [2025-03-17 06:13:02,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:13:02,447 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 476 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:02,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1046 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 06:13:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-17 06:13:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 232. [2025-03-17 06:13:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 215 states have (on average 1.2930232558139534) internal successors, (278), 216 states have internal predecessors, (278), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:13:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 306 transitions. [2025-03-17 06:13:02,466 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 306 transitions. Word has length 121 [2025-03-17 06:13:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:02,467 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 306 transitions. [2025-03-17 06:13:02,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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 06:13:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 306 transitions. [2025-03-17 06:13:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:13:02,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:02,468 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, 1, 1, 1] [2025-03-17 06:13:02,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 06:13:02,468 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:02,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1651253924, now seen corresponding path program 1 times [2025-03-17 06:13:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:02,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364974061] [2025-03-17 06:13:02,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:02,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:02,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:13:02,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:13:02,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:02,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:02,677 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 06:13:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364974061] [2025-03-17 06:13:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364974061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:13:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861049055] [2025-03-17 06:13:02,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:02,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:13:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:02,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:13:02,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:02,682 INFO L87 Difference]: Start difference. First operand 232 states and 306 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 06:13:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:02,711 INFO L93 Difference]: Finished difference Result 463 states and 611 transitions. [2025-03-17 06:13:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:13:02,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 121 [2025-03-17 06:13:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:02,713 INFO L225 Difference]: With dead ends: 463 [2025-03-17 06:13:02,713 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 06:13:02,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:02,714 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:02,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 409 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:13:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 06:13:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-17 06:13:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 215 states have (on average 1.283720930232558) internal successors, (276), 216 states have internal predecessors, (276), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:13:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 304 transitions. [2025-03-17 06:13:02,740 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 304 transitions. Word has length 121 [2025-03-17 06:13:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:02,741 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 304 transitions. [2025-03-17 06:13:02,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 06:13:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 304 transitions. [2025-03-17 06:13:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 06:13:02,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:02,742 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, 1, 1, 1, 1, 1] [2025-03-17 06:13:02,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 06:13:02,742 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:02,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash 625287529, now seen corresponding path program 1 times [2025-03-17 06:13:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:02,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720279] [2025-03-17 06:13:02,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:02,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:02,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 06:13:02,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 06:13:02,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:02,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat