./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -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 d49205c4ffe20d5beac0ad3125002385f97f5ba1191dc9c85bce9eb1aba82790 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:29:04,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:29:04,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:29:04,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:29:04,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:29:05,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:29:05,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:29:05,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:29:05,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:29:05,009 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:29:05,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:29:05,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:29:05,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:29:05,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:29:05,010 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:29:05,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:29:05,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:29:05,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:29:05,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:29:05,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:29:05,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:29:05,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:29:05,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:29:05,013 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 -> d49205c4ffe20d5beac0ad3125002385f97f5ba1191dc9c85bce9eb1aba82790 [2025-03-16 19:29:05,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:29:05,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:29:05,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:29:05,253 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:29:05,253 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:29:05,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-16 19:29:06,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac342526/5a21a850d49d49e1840daa753e7222ce/FLAG8f49d2303 [2025-03-16 19:29:06,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:29:06,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-16 19:29:06,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac342526/5a21a850d49d49e1840daa753e7222ce/FLAG8f49d2303 [2025-03-16 19:29:06,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac342526/5a21a850d49d49e1840daa753e7222ce [2025-03-16 19:29:06,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:29:06,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:29:06,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:29:06,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:29:06,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:29:06,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:29:06" (1/1) ... [2025-03-16 19:29:06,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644b0937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:06, skipping insertion in model container [2025-03-16 19:29:06,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:29:06" (1/1) ... [2025-03-16 19:29:06,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:29:06,987 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/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[7365,7378] [2025-03-16 19:29:07,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:29:07,038 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:29:07,089 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/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[7365,7378] [2025-03-16 19:29:07,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:29:07,128 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:29:07,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07 WrapperNode [2025-03-16 19:29:07,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:29:07,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:29:07,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:29:07,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:29:07,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,185 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 688 [2025-03-16 19:29:07,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:29:07,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:29:07,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:29:07,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:29:07,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,223 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:29:07,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:29:07,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:29:07,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:29:07,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:29:07,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (1/1) ... [2025-03-16 19:29:07,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:29:07,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:29:07,286 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-16 19:29:07,289 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-16 19:29:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:29:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:29:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:29:07,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:29:07,404 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:29:07,406 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:29:07,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:07,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: havoc main_~node4__m4~0#1; [2025-03-16 19:29:07,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L599: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:07,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L302: havoc main_~node5__m5~0#1; [2025-03-16 19:29:07,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: havoc main_~node6__m6~0#1; [2025-03-16 19:29:07,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L799: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:07,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:07,947 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node6____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L886: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L771: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L427: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L858: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:07,948 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~node2__m2~0#1; [2025-03-16 19:29:07,949 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:07,949 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc main_~node3__m3~0#1; [2025-03-16 19:29:07,977 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-16 19:29:07,977 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:29:07,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:29:07,986 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:29:07,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:29:07 BoogieIcfgContainer [2025-03-16 19:29:07,987 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:29:07,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:29:07,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:29:07,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:29:07,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:29:06" (1/3) ... [2025-03-16 19:29:07,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758a729a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:29:07, skipping insertion in model container [2025-03-16 19:29:07,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:07" (2/3) ... [2025-03-16 19:29:07,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758a729a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:29:07, skipping insertion in model container [2025-03-16 19:29:07,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:29:07" (3/3) ... [2025-03-16 19:29:07,993 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-16 19:29:08,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:29:08,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c that has 1 procedures, 162 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:29:08,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:29:08,064 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;@1a70c559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:29:08,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:29:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.7125) internal successors, (274), 161 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:29:08,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:08,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:08,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:08,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash -70493434, now seen corresponding path program 1 times [2025-03-16 19:29:08,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:08,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305480681] [2025-03-16 19:29:08,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:08,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:08,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:29:08,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:29:08,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:08,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305480681] [2025-03-16 19:29:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305480681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:08,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429483413] [2025-03-16 19:29:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:08,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:08,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:08,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:08,525 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.7125) internal successors, (274), 161 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:08,583 INFO L93 Difference]: Finished difference Result 384 states and 626 transitions. [2025-03-16 19:29:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:08,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:29:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:08,590 INFO L225 Difference]: With dead ends: 384 [2025-03-16 19:29:08,591 INFO L226 Difference]: Without dead ends: 259 [2025-03-16 19:29:08,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:08,596 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 212 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:08,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 608 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-16 19:29:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2025-03-16 19:29:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.50390625) internal successors, (385), 256 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2025-03-16 19:29:08,630 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 72 [2025-03-16 19:29:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:08,630 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2025-03-16 19:29:08,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2025-03-16 19:29:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:29:08,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:08,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:08,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:29:08,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:08,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash -115544366, now seen corresponding path program 1 times [2025-03-16 19:29:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:08,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349030255] [2025-03-16 19:29:08,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:08,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:29:08,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:29:08,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:08,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349030255] [2025-03-16 19:29:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349030255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228142363] [2025-03-16 19:29:08,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:08,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:08,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:08,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:08,812 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:08,851 INFO L93 Difference]: Finished difference Result 653 states and 1017 transitions. [2025-03-16 19:29:08,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:08,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 19:29:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:08,854 INFO L225 Difference]: With dead ends: 653 [2025-03-16 19:29:08,854 INFO L226 Difference]: Without dead ends: 439 [2025-03-16 19:29:08,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:08,855 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 168 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:08,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 538 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-16 19:29:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2025-03-16 19:29:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 672 transitions. [2025-03-16 19:29:08,876 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 672 transitions. Word has length 73 [2025-03-16 19:29:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:08,876 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 672 transitions. [2025-03-16 19:29:08,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 672 transitions. [2025-03-16 19:29:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:29:08,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:08,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:08,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:29:08,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:08,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1212965472, now seen corresponding path program 1 times [2025-03-16 19:29:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283369880] [2025-03-16 19:29:08,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:08,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:29:08,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:29:08,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:08,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:09,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:09,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283369880] [2025-03-16 19:29:09,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283369880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:09,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:09,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:09,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338024498] [2025-03-16 19:29:09,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:09,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:09,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:09,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:09,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,021 INFO L87 Difference]: Start difference. First operand 437 states and 672 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:09,048 INFO L93 Difference]: Finished difference Result 1161 states and 1826 transitions. [2025-03-16 19:29:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:09,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:29:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:09,051 INFO L225 Difference]: With dead ends: 1161 [2025-03-16 19:29:09,051 INFO L226 Difference]: Without dead ends: 767 [2025-03-16 19:29:09,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,053 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 163 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:09,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 523 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-03-16 19:29:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2025-03-16 19:29:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.5602094240837696) internal successors, (1192), 764 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1192 transitions. [2025-03-16 19:29:09,107 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1192 transitions. Word has length 74 [2025-03-16 19:29:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1192 transitions. [2025-03-16 19:29:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1192 transitions. [2025-03-16 19:29:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:29:09,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:09,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:09,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:29:09,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:09,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 231598956, now seen corresponding path program 1 times [2025-03-16 19:29:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389238282] [2025-03-16 19:29:09,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:09,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:09,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:29:09,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:29:09,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:09,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:09,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389238282] [2025-03-16 19:29:09,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389238282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:09,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:09,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545437586] [2025-03-16 19:29:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:09,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:09,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:09,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:09,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,216 INFO L87 Difference]: Start difference. First operand 765 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:09,250 INFO L93 Difference]: Finished difference Result 2081 states and 3282 transitions. [2025-03-16 19:29:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:09,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 19:29:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:09,255 INFO L225 Difference]: With dead ends: 2081 [2025-03-16 19:29:09,255 INFO L226 Difference]: Without dead ends: 1359 [2025-03-16 19:29:09,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,257 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 158 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:09,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 508 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-03-16 19:29:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1357. [2025-03-16 19:29:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 1.5663716814159292) internal successors, (2124), 1356 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 2124 transitions. [2025-03-16 19:29:09,288 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 2124 transitions. Word has length 75 [2025-03-16 19:29:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:09,288 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 2124 transitions. [2025-03-16 19:29:09,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 2124 transitions. [2025-03-16 19:29:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:29:09,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:09,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:09,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:29:09,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:09,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2006682554, now seen corresponding path program 1 times [2025-03-16 19:29:09,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:09,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099409658] [2025-03-16 19:29:09,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:09,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:29:09,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:29:09,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:09,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099409658] [2025-03-16 19:29:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099409658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:09,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747462503] [2025-03-16 19:29:09,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:09,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:09,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:09,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,412 INFO L87 Difference]: Start difference. First operand 1357 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:09,444 INFO L93 Difference]: Finished difference Result 3729 states and 5870 transitions. [2025-03-16 19:29:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:09,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:29:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:09,451 INFO L225 Difference]: With dead ends: 3729 [2025-03-16 19:29:09,452 INFO L226 Difference]: Without dead ends: 2415 [2025-03-16 19:29:09,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,454 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 153 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:09,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 493 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2025-03-16 19:29:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2413. [2025-03-16 19:29:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2413 states, 2412 states have (on average 1.5638474295190714) internal successors, (3772), 2412 states have internal predecessors, (3772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 3772 transitions. [2025-03-16 19:29:09,515 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 3772 transitions. Word has length 76 [2025-03-16 19:29:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:09,517 INFO L471 AbstractCegarLoop]: Abstraction has 2413 states and 3772 transitions. [2025-03-16 19:29:09,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3772 transitions. [2025-03-16 19:29:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:29:09,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:09,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:09,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:29:09,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:09,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:09,520 INFO L85 PathProgramCache]: Analyzing trace with hash -498992634, now seen corresponding path program 1 times [2025-03-16 19:29:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:09,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557339435] [2025-03-16 19:29:09,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:09,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:29:09,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:29:09,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:09,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557339435] [2025-03-16 19:29:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557339435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:09,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:09,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192760764] [2025-03-16 19:29:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:09,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:09,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:09,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,604 INFO L87 Difference]: Start difference. First operand 2413 states and 3772 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:09,662 INFO L93 Difference]: Finished difference Result 6641 states and 10398 transitions. [2025-03-16 19:29:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:09,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:29:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:09,676 INFO L225 Difference]: With dead ends: 6641 [2025-03-16 19:29:09,676 INFO L226 Difference]: Without dead ends: 4271 [2025-03-16 19:29:09,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,680 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 148 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:09,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 478 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2025-03-16 19:29:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 4269. [2025-03-16 19:29:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4269 states, 4268 states have (on average 1.5548266166822868) internal successors, (6636), 4268 states have internal predecessors, (6636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4269 states to 4269 states and 6636 transitions. [2025-03-16 19:29:09,774 INFO L78 Accepts]: Start accepts. Automaton has 4269 states and 6636 transitions. Word has length 77 [2025-03-16 19:29:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:09,774 INFO L471 AbstractCegarLoop]: Abstraction has 4269 states and 6636 transitions. [2025-03-16 19:29:09,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 6636 transitions. [2025-03-16 19:29:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:29:09,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:09,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:09,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:29:09,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:09,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:09,777 INFO L85 PathProgramCache]: Analyzing trace with hash -179185900, now seen corresponding path program 1 times [2025-03-16 19:29:09,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:09,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23989154] [2025-03-16 19:29:09,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:09,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:29:09,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:29:09,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:09,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:10,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23989154] [2025-03-16 19:29:10,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23989154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:10,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499495219] [2025-03-16 19:29:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:10,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:10,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:10,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:10,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:10,028 INFO L87 Difference]: Start difference. First operand 4269 states and 6636 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:10,307 INFO L93 Difference]: Finished difference Result 33851 states and 52787 transitions. [2025-03-16 19:29:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:29:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:10,393 INFO L225 Difference]: With dead ends: 33851 [2025-03-16 19:29:10,394 INFO L226 Difference]: Without dead ends: 29625 [2025-03-16 19:29:10,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:29:10,412 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 2127 mSDsluCounter, 3653 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2127 SdHoareTripleChecker+Valid, 3879 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:10,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2127 Valid, 3879 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29625 states. [2025-03-16 19:29:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29625 to 8493. [2025-03-16 19:29:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 8492 states have (on average 1.5426283560998586) internal successors, (13100), 8492 states have internal predecessors, (13100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 13100 transitions. [2025-03-16 19:29:10,784 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 13100 transitions. Word has length 78 [2025-03-16 19:29:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:10,784 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 13100 transitions. [2025-03-16 19:29:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 13100 transitions. [2025-03-16 19:29:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:29:10,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:10,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:10,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:29:10,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:10,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1258840234, now seen corresponding path program 1 times [2025-03-16 19:29:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898486167] [2025-03-16 19:29:10,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:10,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:29:10,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:29:10,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:10,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898486167] [2025-03-16 19:29:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898486167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370187302] [2025-03-16 19:29:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:11,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:11,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:11,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:11,044 INFO L87 Difference]: Start difference. First operand 8493 states and 13100 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:11,281 INFO L93 Difference]: Finished difference Result 51513 states and 78770 transitions. [2025-03-16 19:29:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:29:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:11,354 INFO L225 Difference]: With dead ends: 51513 [2025-03-16 19:29:11,355 INFO L226 Difference]: Without dead ends: 43063 [2025-03-16 19:29:11,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:11,382 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 1124 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:11,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 1227 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43063 states. [2025-03-16 19:29:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43063 to 43053. [2025-03-16 19:29:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43053 states, 43052 states have (on average 1.5232741800613212) internal successors, (65580), 43052 states have internal predecessors, (65580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43053 states to 43053 states and 65580 transitions. [2025-03-16 19:29:12,211 INFO L78 Accepts]: Start accepts. Automaton has 43053 states and 65580 transitions. Word has length 79 [2025-03-16 19:29:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:12,211 INFO L471 AbstractCegarLoop]: Abstraction has 43053 states and 65580 transitions. [2025-03-16 19:29:12,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 43053 states and 65580 transitions. [2025-03-16 19:29:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:29:12,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:12,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:12,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:29:12,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:12,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash 590719059, now seen corresponding path program 1 times [2025-03-16 19:29:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:12,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179311651] [2025-03-16 19:29:12,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:12,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:12,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:29:12,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:29:12,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:12,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179311651] [2025-03-16 19:29:12,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179311651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:12,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:12,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291196751] [2025-03-16 19:29:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:12,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:12,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:12,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:12,339 INFO L87 Difference]: Start difference. First operand 43053 states and 65580 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:12,994 INFO L93 Difference]: Finished difference Result 129073 states and 196654 transitions. [2025-03-16 19:29:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:29:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:13,130 INFO L225 Difference]: With dead ends: 129073 [2025-03-16 19:29:13,130 INFO L226 Difference]: Without dead ends: 86063 [2025-03-16 19:29:13,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 19:29:13,166 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 940 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:13,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 285 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86063 states. [2025-03-16 19:29:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86063 to 86061. [2025-03-16 19:29:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86061 states, 86060 states have (on average 1.5183360446200325) internal successors, (130668), 86060 states have internal predecessors, (130668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86061 states to 86061 states and 130668 transitions. [2025-03-16 19:29:14,596 INFO L78 Accepts]: Start accepts. Automaton has 86061 states and 130668 transitions. Word has length 81 [2025-03-16 19:29:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 86061 states and 130668 transitions. [2025-03-16 19:29:14,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 86061 states and 130668 transitions. [2025-03-16 19:29:14,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:29:14,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:14,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:14,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:29:14,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:14,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash 94284500, now seen corresponding path program 1 times [2025-03-16 19:29:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:14,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71210310] [2025-03-16 19:29:14,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:14,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:29:14,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:29:14,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:14,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:14,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:14,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71210310] [2025-03-16 19:29:14,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71210310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:14,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:14,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933537515] [2025-03-16 19:29:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:14,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:14,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:14,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:14,856 INFO L87 Difference]: Start difference. First operand 86061 states and 130668 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:15,127 INFO L93 Difference]: Finished difference Result 89135 states and 135277 transitions. [2025-03-16 19:29:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:15,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:29:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:15,250 INFO L225 Difference]: With dead ends: 89135 [2025-03-16 19:29:15,251 INFO L226 Difference]: Without dead ends: 89133 [2025-03-16 19:29:15,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:15,282 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:15,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89133 states. [2025-03-16 19:29:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89133 to 89133. [2025-03-16 19:29:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89133 states, 89132 states have (on average 1.500471211237266) internal successors, (133740), 89132 states have internal predecessors, (133740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89133 states to 89133 states and 133740 transitions. [2025-03-16 19:29:16,462 INFO L78 Accepts]: Start accepts. Automaton has 89133 states and 133740 transitions. Word has length 81 [2025-03-16 19:29:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:16,462 INFO L471 AbstractCegarLoop]: Abstraction has 89133 states and 133740 transitions. [2025-03-16 19:29:16,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 89133 states and 133740 transitions. [2025-03-16 19:29:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:29:16,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:16,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:16,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:29:16,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:16,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1367379178, now seen corresponding path program 1 times [2025-03-16 19:29:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:16,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078634451] [2025-03-16 19:29:16,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:16,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:29:16,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:29:16,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:16,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:16,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:16,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078634451] [2025-03-16 19:29:16,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078634451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:16,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:16,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757033882] [2025-03-16 19:29:16,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:16,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:16,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:16,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:16,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:16,537 INFO L87 Difference]: Start difference. First operand 89133 states and 133740 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:17,211 INFO L93 Difference]: Finished difference Result 220019 states and 330176 transitions. [2025-03-16 19:29:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:17,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:29:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:17,609 INFO L225 Difference]: With dead ends: 220019 [2025-03-16 19:29:17,610 INFO L226 Difference]: Without dead ends: 130929 [2025-03-16 19:29:17,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:17,637 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 138 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:17,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 463 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130929 states. [2025-03-16 19:29:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130929 to 130927. [2025-03-16 19:29:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130927 states, 130926 states have (on average 1.4953026900691995) internal successors, (195774), 130926 states have internal predecessors, (195774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130927 states to 130927 states and 195774 transitions. [2025-03-16 19:29:19,608 INFO L78 Accepts]: Start accepts. Automaton has 130927 states and 195774 transitions. Word has length 82 [2025-03-16 19:29:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:19,608 INFO L471 AbstractCegarLoop]: Abstraction has 130927 states and 195774 transitions. [2025-03-16 19:29:19,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 130927 states and 195774 transitions. [2025-03-16 19:29:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:29:19,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:19,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:29:19,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:19,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:19,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1192216810, now seen corresponding path program 1 times [2025-03-16 19:29:19,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201239398] [2025-03-16 19:29:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:19,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:29:19,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:29:19,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:19,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:29:19,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:19,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201239398] [2025-03-16 19:29:19,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201239398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:29:19,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189691934] [2025-03-16 19:29:19,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:19,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:29:19,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:29:19,844 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-16 19:29:19,846 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-16 19:29:19,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:29:20,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:29:20,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:20,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:20,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 19:29:20,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:29:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:20,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:29:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189691934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:29:21,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:29:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 8] total 17 [2025-03-16 19:29:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673407915] [2025-03-16 19:29:21,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:29:21,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:29:21,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:21,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:29:21,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:29:21,680 INFO L87 Difference]: Start difference. First operand 130927 states and 195774 transitions. Second operand has 17 states, 17 states have (on average 17.529411764705884) internal successors, (298), 17 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:23,445 INFO L93 Difference]: Finished difference Result 403250 states and 601905 transitions. [2025-03-16 19:29:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:29:23,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 17.529411764705884) internal successors, (298), 17 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:29:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:23,848 INFO L225 Difference]: With dead ends: 403250 [2025-03-16 19:29:23,848 INFO L226 Difference]: Without dead ends: 272368 [2025-03-16 19:29:23,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=331, Invalid=725, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:29:23,928 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 4034 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4034 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:23,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4034 Valid, 3180 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272368 states. [2025-03-16 19:29:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272368 to 222150. [2025-03-16 19:29:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222150 states, 222149 states have (on average 1.4849717982075095) internal successors, (329885), 222149 states have internal predecessors, (329885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222150 states to 222150 states and 329885 transitions. [2025-03-16 19:29:27,611 INFO L78 Accepts]: Start accepts. Automaton has 222150 states and 329885 transitions. Word has length 111 [2025-03-16 19:29:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:27,611 INFO L471 AbstractCegarLoop]: Abstraction has 222150 states and 329885 transitions. [2025-03-16 19:29:27,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 17.529411764705884) internal successors, (298), 17 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 222150 states and 329885 transitions. [2025-03-16 19:29:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:29:27,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:27,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:27,629 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-16 19:29:27,826 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,SelfDestructingSolverStorable11 [2025-03-16 19:29:27,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:27,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 236964383, now seen corresponding path program 1 times [2025-03-16 19:29:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015741069] [2025-03-16 19:29:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:27,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:29:27,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:29:27,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:27,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015741069] [2025-03-16 19:29:27,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015741069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:27,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:27,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:27,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464128643] [2025-03-16 19:29:27,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:27,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:27,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:27,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:27,905 INFO L87 Difference]: Start difference. First operand 222150 states and 329885 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:29,618 INFO L93 Difference]: Finished difference Result 592828 states and 879266 transitions. [2025-03-16 19:29:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:29:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:30,322 INFO L225 Difference]: With dead ends: 592828 [2025-03-16 19:29:30,323 INFO L226 Difference]: Without dead ends: 396424 [2025-03-16 19:29:30,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:30,500 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 135 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:30,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 443 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396424 states. [2025-03-16 19:29:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396424 to 396422. [2025-03-16 19:29:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396422 states, 396421 states have (on average 1.4729164196649522) internal successors, (583895), 396421 states have internal predecessors, (583895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396422 states to 396422 states and 583895 transitions. [2025-03-16 19:29:36,691 INFO L78 Accepts]: Start accepts. Automaton has 396422 states and 583895 transitions. Word has length 112 [2025-03-16 19:29:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:36,691 INFO L471 AbstractCegarLoop]: Abstraction has 396422 states and 583895 transitions. [2025-03-16 19:29:36,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 396422 states and 583895 transitions. [2025-03-16 19:29:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:29:36,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:36,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:29:36,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:29:36,712 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1677712071, now seen corresponding path program 1 times [2025-03-16 19:29:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430217737] [2025-03-16 19:29:36,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:36,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:29:36,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:29:36,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:36,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:36,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:36,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430217737] [2025-03-16 19:29:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430217737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:36,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979304062] [2025-03-16 19:29:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:36,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:36,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:36,777 INFO L87 Difference]: Start difference. First operand 396422 states and 583895 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:40,188 INFO L93 Difference]: Finished difference Result 1071529 states and 1574658 transitions. [2025-03-16 19:29:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:29:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:41,983 INFO L225 Difference]: With dead ends: 1071529 [2025-03-16 19:29:41,983 INFO L226 Difference]: Without dead ends: 701173 [2025-03-16 19:29:42,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:42,146 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 136 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:42,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 462 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701173 states.