./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.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 57bda971cc74fc0d01c70e8ff55abb0ecbc2be19f4d9bb39359109904330c6bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:47:27,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:47:27,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:47:27,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:47:27,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:47:27,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:47:27,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:47:27,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:47:27,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:47:27,565 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:47:27,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:47:27,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:47:27,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:47:27,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:47:27,566 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:47:27,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:47:27,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:47:27,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:47:27,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:47:27,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:47:27,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:47:27,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:47:27,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:47:27,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:27,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:47:27,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:47:27,569 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 -> 57bda971cc74fc0d01c70e8ff55abb0ecbc2be19f4d9bb39359109904330c6bf [2025-03-04 01:47:27,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:47:27,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:47:27,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:47:27,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:47:27,789 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:47:27,790 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-14.i [2025-03-04 01:47:28,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ca43a9cf/210b1d345bd748e4af86854646fdd400/FLAG902d69067 [2025-03-04 01:47:29,196 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:47:29,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i [2025-03-04 01:47:29,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ca43a9cf/210b1d345bd748e4af86854646fdd400/FLAG902d69067 [2025-03-04 01:47:29,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ca43a9cf/210b1d345bd748e4af86854646fdd400 [2025-03-04 01:47:29,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:47:29,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:47:29,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:29,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:47:29,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:47:29,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fcc584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29, skipping insertion in model container [2025-03-04 01:47:29,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:47:29,633 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-14.i[917,930] [2025-03-04 01:47:29,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:29,694 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:47:29,701 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-14.i[917,930] [2025-03-04 01:47:29,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:29,756 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:47:29,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29 WrapperNode [2025-03-04 01:47:29,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:29,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:29,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:47:29,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:47:29,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,795 INFO L138 Inliner]: procedures = 30, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 574 [2025-03-04 01:47:29,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:29,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:47:29,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:47:29,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:47:29,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,809 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:47:29,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:47:29,826 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:47:29,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:47:29,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:47:29,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (1/1) ... [2025-03-04 01:47:29,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:29,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:29,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:47:29,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:47:29,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:47:29,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:47:29,986 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:47:29,987 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:47:30,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L142: havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem128#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite160#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite157#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem156#1;havoc property_#t~mem146#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite145#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite155#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite154#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1; [2025-03-04 01:47:30,456 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-03-04 01:47:30,456 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:47:30,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:47:30,464 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:47:30,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:30 BoogieIcfgContainer [2025-03-04 01:47:30,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:47:30,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:47:30,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:47:30,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:47:30,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:47:29" (1/3) ... [2025-03-04 01:47:30,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78750f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:47:30, skipping insertion in model container [2025-03-04 01:47:30,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:29" (2/3) ... [2025-03-04 01:47:30,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78750f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:47:30, skipping insertion in model container [2025-03-04 01:47:30,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:30" (3/3) ... [2025-03-04 01:47:30,472 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-14.i [2025-03-04 01:47:30,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:47:30,484 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-14.i that has 2 procedures, 127 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:47:30,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:47:30,538 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;@6a69c11f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:47:30,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:47:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:47:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:47:30,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:30,549 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:30,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:30,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:30,553 INFO L85 PathProgramCache]: Analyzing trace with hash -971381059, now seen corresponding path program 1 times [2025-03-04 01:47:30,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:30,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115747255] [2025-03-04 01:47:30,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:30,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:47:30,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:47:30,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:30,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:47:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:30,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115747255] [2025-03-04 01:47:30,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115747255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:30,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8051045] [2025-03-04 01:47:30,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:30,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:30,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:30,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:47:30,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:47:31,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:47:31,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:47:31,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:31,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:47:31,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:47:31,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:47:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8051045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:31,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:47:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:47:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895647926] [2025-03-04 01:47:31,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:31,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:47:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:31,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:47:31,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:47:31,178 INFO L87 Difference]: Start difference. First operand has 127 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:47:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:31,195 INFO L93 Difference]: Finished difference Result 248 states and 392 transitions. [2025-03-04 01:47:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:47:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:47:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:31,201 INFO L225 Difference]: With dead ends: 248 [2025-03-04 01:47:31,201 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 01:47:31,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:47:31,206 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:31,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:47:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 01:47:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-04 01:47:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:47:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-03-04 01:47:31,231 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2025-03-04 01:47:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:31,232 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-03-04 01:47:31,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:47:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-03-04 01:47:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:47:31,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:31,234 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:31,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:47:31,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:47:31,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:31,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash 382591566, now seen corresponding path program 1 times [2025-03-04 01:47:31,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:31,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395853625] [2025-03-04 01:47:31,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:31,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:31,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:47:31,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:47:31,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:31,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:47:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395853625] [2025-03-04 01:47:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395853625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:47:32,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61924958] [2025-03-04 01:47:32,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:32,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:47:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:32,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:47:32,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:47:32,553 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:47:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:32,810 INFO L93 Difference]: Finished difference Result 367 states and 544 transitions. [2025-03-04 01:47:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:47:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:47:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:32,812 INFO L225 Difference]: With dead ends: 367 [2025-03-04 01:47:32,812 INFO L226 Difference]: Without dead ends: 246 [2025-03-04 01:47:32,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:47:32,813 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 149 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:32,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 426 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:47:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-04 01:47:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 218. [2025-03-04 01:47:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 173 states have internal predecessors, (239), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:47:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 323 transitions. [2025-03-04 01:47:32,838 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 323 transitions. Word has length 168 [2025-03-04 01:47:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:32,838 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 323 transitions. [2025-03-04 01:47:32,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:47:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2025-03-04 01:47:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:47:32,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:32,842 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:47:32,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash 315584813, now seen corresponding path program 1 times [2025-03-04 01:47:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093277697] [2025-03-04 01:47:32,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:32,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:47:32,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:47:32,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:32,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:47:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093277697] [2025-03-04 01:47:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093277697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:47:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145629139] [2025-03-04 01:47:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:33,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:47:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:33,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:47:33,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:47:33,435 INFO L87 Difference]: Start difference. First operand 218 states and 323 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:47:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:33,788 INFO L93 Difference]: Finished difference Result 384 states and 568 transitions. [2025-03-04 01:47:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:47:33,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:47:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:33,791 INFO L225 Difference]: With dead ends: 384 [2025-03-04 01:47:33,791 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 01:47:33,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:47:33,792 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 183 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:33,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 528 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:47:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 01:47:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 228. [2025-03-04 01:47:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 183 states have (on average 1.3825136612021858) internal successors, (253), 183 states have internal predecessors, (253), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:47:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 337 transitions. [2025-03-04 01:47:33,817 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 337 transitions. Word has length 168 [2025-03-04 01:47:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:33,817 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 337 transitions. [2025-03-04 01:47:33,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:47:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2025-03-04 01:47:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:47:33,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:33,819 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:33,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:47:33,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:33,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash -189973812, now seen corresponding path program 1 times [2025-03-04 01:47:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:33,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794988320] [2025-03-04 01:47:33,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:33,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:33,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:47:33,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:47:33,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:33,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:47:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794988320] [2025-03-04 01:47:34,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794988320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:34,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:34,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:47:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5721692] [2025-03-04 01:47:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:34,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:47:34,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:34,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:47:34,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:47:34,407 INFO L87 Difference]: Start difference. First operand 228 states and 337 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:47:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:34,616 INFO L93 Difference]: Finished difference Result 399 states and 586 transitions. [2025-03-04 01:47:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:47:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:47:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:34,620 INFO L225 Difference]: With dead ends: 399 [2025-03-04 01:47:34,620 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 01:47:34,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:47:34,622 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 56 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:34,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 565 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:47:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 01:47:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 230. [2025-03-04 01:47:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3783783783783783) internal successors, (255), 185 states have internal predecessors, (255), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:47:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 339 transitions. [2025-03-04 01:47:34,647 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 339 transitions. Word has length 168 [2025-03-04 01:47:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:34,647 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 339 transitions. [2025-03-04 01:47:34,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:47:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 339 transitions. [2025-03-04 01:47:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:47:34,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:34,650 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:34,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:47:34,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:34,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1317577997, now seen corresponding path program 1 times [2025-03-04 01:47:34,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:34,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919253430] [2025-03-04 01:47:34,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:34,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:34,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:47:34,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:47:34,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:34,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:47:35,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:35,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919253430] [2025-03-04 01:47:35,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919253430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:35,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:35,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:47:35,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934205035] [2025-03-04 01:47:35,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:35,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:47:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:35,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:47:35,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:47:35,136 INFO L87 Difference]: Start difference. First operand 230 states and 339 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:47:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:35,300 INFO L93 Difference]: Finished difference Result 396 states and 580 transitions. [2025-03-04 01:47:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:35,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:47:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:35,302 INFO L225 Difference]: With dead ends: 396 [2025-03-04 01:47:35,302 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 01:47:35,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:47:35,303 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 98 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:35,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 620 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:47:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 01:47:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 226. [2025-03-04 01:47:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.3535911602209945) internal successors, (245), 181 states have internal predecessors, (245), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:47:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2025-03-04 01:47:35,317 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 168 [2025-03-04 01:47:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:35,317 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2025-03-04 01:47:35,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:47:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2025-03-04 01:47:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 01:47:35,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:35,318 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:35,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:47:35,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:35,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1104118422, now seen corresponding path program 1 times [2025-03-04 01:47:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969166993] [2025-03-04 01:47:35,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:35,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:35,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 01:47:35,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 01:47:35,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:35,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-04 01:47:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:36,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969166993] [2025-03-04 01:47:36,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969166993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:36,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307837679] [2025-03-04 01:47:36,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:36,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:36,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:36,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:47:36,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:47:36,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 01:47:37,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 01:47:37,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:37,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:37,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 01:47:37,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:38,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:47:39,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:39,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:39,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:40,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:40,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:40,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:40,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:40,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:40,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:40,787 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-04 01:47:40,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2025-03-04 01:47:40,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:40,988 INFO L349 Elim1Store]: treesize reduction 52, result has 49.0 percent of original size [2025-03-04 01:47:40,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 65 [2025-03-04 01:47:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 358 proven. 176 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-03-04 01:47:41,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:47:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307837679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:41,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:47:41,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2025-03-04 01:47:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757739945] [2025-03-04 01:47:41,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:47:41,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:47:41,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:41,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:47:41,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:47:41,692 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 22 states, 20 states have (on average 6.6) internal successors, (132), 22 states have internal predecessors, (132), 9 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 9 states have call successors, (42) [2025-03-04 01:47:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:43,387 INFO L93 Difference]: Finished difference Result 452 states and 637 transitions. [2025-03-04 01:47:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 01:47:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.6) internal successors, (132), 22 states have internal predecessors, (132), 9 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 9 states have call successors, (42) Word has length 170 [2025-03-04 01:47:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:43,389 INFO L225 Difference]: With dead ends: 452 [2025-03-04 01:47:43,389 INFO L226 Difference]: Without dead ends: 319 [2025-03-04 01:47:43,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 01:47:43,391 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 456 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:43,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 518 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:47:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-04 01:47:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 306. [2025-03-04 01:47:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 247 states have (on average 1.3036437246963564) internal successors, (322), 248 states have internal predecessors, (322), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:47:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 426 transitions. [2025-03-04 01:47:43,418 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 426 transitions. Word has length 170 [2025-03-04 01:47:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:43,418 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 426 transitions. [2025-03-04 01:47:43,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.6) internal successors, (132), 22 states have internal predecessors, (132), 9 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 9 states have call successors, (42) [2025-03-04 01:47:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 426 transitions. [2025-03-04 01:47:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 01:47:43,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:43,419 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:43,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:47:43,624 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,SelfDestructingSolverStorable5 [2025-03-04 01:47:43,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:43,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1060304534, now seen corresponding path program 1 times [2025-03-04 01:47:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846243706] [2025-03-04 01:47:43,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:43,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 01:47:43,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 01:47:43,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:43,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:47:46,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:46,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846243706] [2025-03-04 01:47:46,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846243706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:46,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:46,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:47:46,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469015754] [2025-03-04 01:47:46,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:46,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:47:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:46,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:47:46,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:47:46,573 INFO L87 Difference]: Start difference. First operand 306 states and 426 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:47:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:48,019 INFO L93 Difference]: Finished difference Result 723 states and 1005 transitions. [2025-03-04 01:47:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:47:48,020 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 170 [2025-03-04 01:47:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:48,023 INFO L225 Difference]: With dead ends: 723 [2025-03-04 01:47:48,023 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 01:47:48,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:47:48,024 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 565 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:48,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 708 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:47:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 01:47:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 368. [2025-03-04 01:47:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 309 states have (on average 1.2944983818770226) internal successors, (400), 310 states have internal predecessors, (400), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:47:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 504 transitions. [2025-03-04 01:47:48,058 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 504 transitions. Word has length 170 [2025-03-04 01:47:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:48,059 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 504 transitions. [2025-03-04 01:47:48,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:47:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 504 transitions. [2025-03-04 01:47:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 01:47:48,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:48,060 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:48,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:47:48,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:48,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1196606473, now seen corresponding path program 1 times [2025-03-04 01:47:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060488257] [2025-03-04 01:47:48,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:48,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 01:47:48,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 01:47:48,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:48,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:47:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060488257] [2025-03-04 01:47:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060488257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:47:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698935370] [2025-03-04 01:47:48,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:48,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:47:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:48,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:47:48,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:47:48,165 INFO L87 Difference]: Start difference. First operand 368 states and 504 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:47:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:48,209 INFO L93 Difference]: Finished difference Result 625 states and 860 transitions. [2025-03-04 01:47:48,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:47:48,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2025-03-04 01:47:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:48,212 INFO L225 Difference]: With dead ends: 625 [2025-03-04 01:47:48,212 INFO L226 Difference]: Without dead ends: 364 [2025-03-04 01:47:48,213 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-04 01:47:48,213 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:48,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:47:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-04 01:47:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-03-04 01:47:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 305 states have (on average 1.2918032786885245) internal successors, (394), 306 states have internal predecessors, (394), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:47:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 498 transitions. [2025-03-04 01:47:48,253 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 498 transitions. Word has length 170 [2025-03-04 01:47:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:48,254 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 498 transitions. [2025-03-04 01:47:48,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:47:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 498 transitions. [2025-03-04 01:47:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 01:47:48,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:48,255 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:48,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:47:48,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:48,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:48,256 INFO L85 PathProgramCache]: Analyzing trace with hash 564453165, now seen corresponding path program 1 times [2025-03-04 01:47:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:48,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789008874] [2025-03-04 01:47:48,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:48,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:47:48,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:47:48,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:48,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-04 01:47:49,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:49,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789008874] [2025-03-04 01:47:49,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789008874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:49,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137138081] [2025-03-04 01:47:49,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:49,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:49,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:49,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:47:49,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:47:49,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:47:49,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:47:49,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:49,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:49,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-04 01:47:49,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:50,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:47:51,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:51,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:51,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:52,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:52,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:52,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:52,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:52,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:47:52,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:52,780 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-04 01:47:52,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2025-03-04 01:47:52,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:53,018 INFO L349 Elim1Store]: treesize reduction 52, result has 49.0 percent of original size [2025-03-04 01:47:53,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 65 [2025-03-04 01:47:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 358 proven. 176 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-03-04 01:47:53,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:47:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137138081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:53,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:47:53,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2025-03-04 01:47:53,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794936304] [2025-03-04 01:47:53,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:47:53,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 01:47:53,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:53,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 01:47:53,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:47:53,782 INFO L87 Difference]: Start difference. First operand 364 states and 498 transitions. Second operand has 25 states, 22 states have (on average 6.181818181818182) internal successors, (136), 25 states have internal predecessors, (136), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) [2025-03-04 01:47:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:55,793 INFO L93 Difference]: Finished difference Result 609 states and 830 transitions. [2025-03-04 01:47:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 01:47:55,793 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.181818181818182) internal successors, (136), 25 states have internal predecessors, (136), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) Word has length 172 [2025-03-04 01:47:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:55,795 INFO L225 Difference]: With dead ends: 609 [2025-03-04 01:47:55,795 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 01:47:55,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=458, Invalid=1894, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 01:47:55,796 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 463 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:55,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 715 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:47:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 01:47:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 280. [2025-03-04 01:47:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 231 states have (on average 1.29004329004329) internal successors, (298), 231 states have internal predecessors, (298), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:47:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 382 transitions. [2025-03-04 01:47:55,824 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 382 transitions. Word has length 172 [2025-03-04 01:47:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:55,824 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 382 transitions. [2025-03-04 01:47:55,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.181818181818182) internal successors, (136), 25 states have internal predecessors, (136), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) [2025-03-04 01:47:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 382 transitions. [2025-03-04 01:47:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 01:47:55,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:55,827 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:55,834 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-04 01:47:56,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:56,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:56,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1496795989, now seen corresponding path program 1 times [2025-03-04 01:47:56,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:56,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17766629] [2025-03-04 01:47:56,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:47:56,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:47:56,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:56,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat