./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.7.ufo.UNBOUNDED.pals.c.v+nlh-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 b8f11c58bd911b111c6f04ca73beac7abb77a983b1f6790a335f756f9ecfba15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:29:30,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:29:30,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:29:30,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:29:30,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:29:30,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:29:30,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:29:30,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:29:30,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:29:30,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:29:30,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:29:30,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:29:30,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:29:30,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:29:30,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:29:30,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:29:30,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:29:30,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:29:30,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:29:30,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:29:30,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:30,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:29:30,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:29:30,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:29:30,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:29:30,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:29:30,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:29:30,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:29:30,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:29:30,227 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 -> b8f11c58bd911b111c6f04ca73beac7abb77a983b1f6790a335f756f9ecfba15 [2025-03-08 06:29:30,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:29:30,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:29:30,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:29:30,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:29:30,481 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:29:30,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:29:31,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56cd1166e/603a39034ed048a199b43d0490d40958/FLAG49433ce56 [2025-03-08 06:29:31,947 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:29:31,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:29:31,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56cd1166e/603a39034ed048a199b43d0490d40958/FLAG49433ce56 [2025-03-08 06:29:32,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56cd1166e/603a39034ed048a199b43d0490d40958 [2025-03-08 06:29:32,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:29:32,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:29:32,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:32,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:29:32,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:29:32,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed9dfb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32, skipping insertion in model container [2025-03-08 06:29:32,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:29:32,437 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.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10376,10389] [2025-03-08 06:29:32,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:32,507 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:29:32,576 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.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10376,10389] [2025-03-08 06:29:32,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:32,617 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:29:32,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32 WrapperNode [2025-03-08 06:29:32,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:32,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:32,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:29:32,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:29:32,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,662 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 902 [2025-03-08 06:29:32,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:32,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:29:32,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:29:32,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:29:32,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,690 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-08 06:29:32,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:29:32,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:29:32,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:29:32,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:29:32,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (1/1) ... [2025-03-08 06:29:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:29:32,731 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-08 06:29:32,735 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-08 06:29:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:29:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:29:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:29:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:29:32,847 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:29:32,848 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:29:33,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node3__m3~2#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L814: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node2__m2~2#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L507: havoc main_~node7__m7~1#1;havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L990: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~node5__m5~2#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L909: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~2#1; [2025-03-08 06:29:33,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node4__m4~2#1; [2025-03-08 06:29:33,436 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-08 06:29:33,436 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:29:33,447 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:29:33,447 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:29:33,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:33 BoogieIcfgContainer [2025-03-08 06:29:33,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:29:33,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:29:33,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:29:33,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:29:33,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:29:32" (1/3) ... [2025-03-08 06:29:33,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1114617b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:33, skipping insertion in model container [2025-03-08 06:29:33,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:32" (2/3) ... [2025-03-08 06:29:33,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1114617b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:33, skipping insertion in model container [2025-03-08 06:29:33,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:33" (3/3) ... [2025-03-08 06:29:33,456 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:29:33,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:29:33,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 201 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:29:33,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:29:33,526 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;@1c2c73ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:29:33,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:29:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.763819095477387) internal successors, (351), 200 states have internal predecessors, (351), 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-08 06:29:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:29:33,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:33,539 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, 1, 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-08 06:29:33,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:33,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1129340721, now seen corresponding path program 1 times [2025-03-08 06:29:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:33,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114514822] [2025-03-08 06:29:33,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:33,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:29:33,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:29:33,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:33,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:34,296 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-08 06:29:34,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:34,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114514822] [2025-03-08 06:29:34,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114514822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:34,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:34,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717871830] [2025-03-08 06:29:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:34,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:34,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:34,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:34,323 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.763819095477387) internal successors, (351), 200 states have internal predecessors, (351), 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 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 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-08 06:29:34,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:34,962 INFO L93 Difference]: Finished difference Result 1440 states and 2328 transitions. [2025-03-08 06:29:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:34,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 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 107 [2025-03-08 06:29:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:34,982 INFO L225 Difference]: With dead ends: 1440 [2025-03-08 06:29:34,983 INFO L226 Difference]: Without dead ends: 1332 [2025-03-08 06:29:34,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:34,991 INFO L435 NwaCegarLoop]: 1070 mSDtfsCounter, 2429 mSDsluCounter, 6748 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 7818 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:34,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2429 Valid, 7818 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-03-08 06:29:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 303. [2025-03-08 06:29:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4503311258278146) internal successors, (438), 302 states have internal predecessors, (438), 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-08 06:29:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 438 transitions. [2025-03-08 06:29:35,059 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 438 transitions. Word has length 107 [2025-03-08 06:29:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:35,060 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 438 transitions. [2025-03-08 06:29:35,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 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-08 06:29:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 438 transitions. [2025-03-08 06:29:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:35,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:35,063 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, 1, 1, 1, 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-08 06:29:35,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:29:35,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:35,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1117734741, now seen corresponding path program 1 times [2025-03-08 06:29:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009927579] [2025-03-08 06:29:35,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:35,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:35,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:35,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:35,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:35,367 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-08 06:29:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009927579] [2025-03-08 06:29:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009927579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:35,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136153766] [2025-03-08 06:29:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:35,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:35,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:35,369 INFO L87 Difference]: Start difference. First operand 303 states and 438 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:35,702 INFO L93 Difference]: Finished difference Result 1559 states and 2435 transitions. [2025-03-08 06:29:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:35,703 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:35,707 INFO L225 Difference]: With dead ends: 1559 [2025-03-08 06:29:35,707 INFO L226 Difference]: Without dead ends: 1399 [2025-03-08 06:29:35,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:35,709 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 1716 mSDsluCounter, 3780 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:35,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 4820 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-08 06:29:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 482. [2025-03-08 06:29:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.5051975051975053) internal successors, (724), 481 states have internal predecessors, (724), 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-08 06:29:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 724 transitions. [2025-03-08 06:29:35,737 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 724 transitions. Word has length 109 [2025-03-08 06:29:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:35,737 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 724 transitions. [2025-03-08 06:29:35,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 724 transitions. [2025-03-08 06:29:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:35,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:35,740 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, 1, 1, 1, 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-08 06:29:35,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:29:35,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:35,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 138871629, now seen corresponding path program 1 times [2025-03-08 06:29:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:35,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117432231] [2025-03-08 06:29:35,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:35,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:35,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:35,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:35,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:36,008 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-08 06:29:36,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:36,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117432231] [2025-03-08 06:29:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117432231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:36,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:36,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:36,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795453793] [2025-03-08 06:29:36,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:36,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:36,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:36,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:36,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:36,010 INFO L87 Difference]: Start difference. First operand 482 states and 724 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:36,340 INFO L93 Difference]: Finished difference Result 1738 states and 2721 transitions. [2025-03-08 06:29:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:36,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:36,348 INFO L225 Difference]: With dead ends: 1738 [2025-03-08 06:29:36,348 INFO L226 Difference]: Without dead ends: 1578 [2025-03-08 06:29:36,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:36,352 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 1709 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 4167 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:36,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 4167 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-08 06:29:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 740. [2025-03-08 06:29:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.537212449255751) internal successors, (1136), 739 states have internal predecessors, (1136), 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-08 06:29:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1136 transitions. [2025-03-08 06:29:36,379 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1136 transitions. Word has length 109 [2025-03-08 06:29:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:36,379 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1136 transitions. [2025-03-08 06:29:36,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1136 transitions. [2025-03-08 06:29:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:36,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:36,381 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, 1, 1, 1, 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-08 06:29:36,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:29:36,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:36,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:36,382 INFO L85 PathProgramCache]: Analyzing trace with hash -708736427, now seen corresponding path program 1 times [2025-03-08 06:29:36,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:36,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655051493] [2025-03-08 06:29:36,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:36,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:36,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:36,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:36,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:36,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:36,644 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-08 06:29:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655051493] [2025-03-08 06:29:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655051493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:36,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206675713] [2025-03-08 06:29:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:36,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:36,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:36,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:36,645 INFO L87 Difference]: Start difference. First operand 740 states and 1136 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:36,921 INFO L93 Difference]: Finished difference Result 1912 states and 2999 transitions. [2025-03-08 06:29:36,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:36,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:36,927 INFO L225 Difference]: With dead ends: 1912 [2025-03-08 06:29:36,928 INFO L226 Difference]: Without dead ends: 1752 [2025-03-08 06:29:36,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:36,931 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 1815 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:36,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 3706 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-03-08 06:29:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 914. [2025-03-08 06:29:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 1.5487404162102958) internal successors, (1414), 913 states have internal predecessors, (1414), 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-08 06:29:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1414 transitions. [2025-03-08 06:29:36,956 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1414 transitions. Word has length 109 [2025-03-08 06:29:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:36,957 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1414 transitions. [2025-03-08 06:29:36,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1414 transitions. [2025-03-08 06:29:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:36,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:36,959 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, 1, 1, 1, 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-08 06:29:36,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:29:36,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash -217866163, now seen corresponding path program 1 times [2025-03-08 06:29:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786751508] [2025-03-08 06:29:36,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:36,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:36,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:36,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:37,160 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-08 06:29:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786751508] [2025-03-08 06:29:37,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786751508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:37,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:37,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332144674] [2025-03-08 06:29:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:37,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:37,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:37,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:37,162 INFO L87 Difference]: Start difference. First operand 914 states and 1414 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:37,407 INFO L93 Difference]: Finished difference Result 2081 states and 3269 transitions. [2025-03-08 06:29:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:37,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:37,414 INFO L225 Difference]: With dead ends: 2081 [2025-03-08 06:29:37,414 INFO L226 Difference]: Without dead ends: 1921 [2025-03-08 06:29:37,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:37,416 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1922 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:37,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 3126 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-03-08 06:29:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1083. [2025-03-08 06:29:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 1.5563770794824399) internal successors, (1684), 1082 states have internal predecessors, (1684), 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-08 06:29:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1684 transitions. [2025-03-08 06:29:37,445 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1684 transitions. Word has length 109 [2025-03-08 06:29:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:37,445 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1684 transitions. [2025-03-08 06:29:37,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1684 transitions. [2025-03-08 06:29:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:37,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:37,446 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, 1, 1, 1, 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-08 06:29:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:29:37,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:37,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:37,447 INFO L85 PathProgramCache]: Analyzing trace with hash -191754923, now seen corresponding path program 1 times [2025-03-08 06:29:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28333926] [2025-03-08 06:29:37,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:37,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:37,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:37,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:37,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:37,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:37,632 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-08 06:29:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28333926] [2025-03-08 06:29:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28333926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929197462] [2025-03-08 06:29:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:37,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:37,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:37,634 INFO L87 Difference]: Start difference. First operand 1083 states and 1684 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:37,855 INFO L93 Difference]: Finished difference Result 2245 states and 3531 transitions. [2025-03-08 06:29:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:37,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:37,860 INFO L225 Difference]: With dead ends: 2245 [2025-03-08 06:29:37,860 INFO L226 Difference]: Without dead ends: 2085 [2025-03-08 06:29:37,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:37,861 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 2026 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:37,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 3136 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-08 06:29:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1247. [2025-03-08 06:29:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 1.5617977528089888) internal successors, (1946), 1246 states have internal predecessors, (1946), 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-08 06:29:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1946 transitions. [2025-03-08 06:29:37,883 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1946 transitions. Word has length 109 [2025-03-08 06:29:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:37,884 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1946 transitions. [2025-03-08 06:29:37,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1946 transitions. [2025-03-08 06:29:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:37,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:37,885 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, 1, 1, 1, 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-08 06:29:37,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:29:37,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:37,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1522138445, now seen corresponding path program 1 times [2025-03-08 06:29:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:37,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245886314] [2025-03-08 06:29:37,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:37,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:37,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:37,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:37,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:38,049 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-08 06:29:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245886314] [2025-03-08 06:29:38,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245886314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072350595] [2025-03-08 06:29:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:38,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:38,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:38,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:38,052 INFO L87 Difference]: Start difference. First operand 1247 states and 1946 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:38,257 INFO L93 Difference]: Finished difference Result 2404 states and 3785 transitions. [2025-03-08 06:29:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:38,263 INFO L225 Difference]: With dead ends: 2404 [2025-03-08 06:29:38,263 INFO L226 Difference]: Without dead ends: 2244 [2025-03-08 06:29:38,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:38,265 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 2129 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:38,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 3329 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2025-03-08 06:29:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1406. [2025-03-08 06:29:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.5658362989323844) internal successors, (2200), 1405 states have internal predecessors, (2200), 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-08 06:29:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2200 transitions. [2025-03-08 06:29:38,292 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2200 transitions. Word has length 109 [2025-03-08 06:29:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:38,292 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2200 transitions. [2025-03-08 06:29:38,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2200 transitions. [2025-03-08 06:29:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:38,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:38,293 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, 1, 1, 1, 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-08 06:29:38,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:29:38,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:38,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1729982701, now seen corresponding path program 1 times [2025-03-08 06:29:38,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:38,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425590953] [2025-03-08 06:29:38,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:38,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:38,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:38,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:38,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:38,453 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-08 06:29:38,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425590953] [2025-03-08 06:29:38,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425590953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:38,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:38,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:38,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449820800] [2025-03-08 06:29:38,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:38,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:38,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:38,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:38,455 INFO L87 Difference]: Start difference. First operand 1406 states and 2200 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:38,667 INFO L93 Difference]: Finished difference Result 2562 states and 4038 transitions. [2025-03-08 06:29:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:38,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:38,674 INFO L225 Difference]: With dead ends: 2562 [2025-03-08 06:29:38,674 INFO L226 Difference]: Without dead ends: 2402 [2025-03-08 06:29:38,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:38,677 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 2223 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 3724 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:38,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 3724 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2025-03-08 06:29:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1564. [2025-03-08 06:29:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.5694177863083814) internal successors, (2453), 1563 states have internal predecessors, (2453), 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-08 06:29:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2453 transitions. [2025-03-08 06:29:38,703 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2453 transitions. Word has length 109 [2025-03-08 06:29:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:38,704 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2453 transitions. [2025-03-08 06:29:38,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2453 transitions. [2025-03-08 06:29:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:38,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:38,710 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, 1, 1, 1, 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-08 06:29:38,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:29:38,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:38,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1291262470, now seen corresponding path program 1 times [2025-03-08 06:29:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:38,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689984396] [2025-03-08 06:29:38,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:38,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:38,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:38,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:38,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:38,790 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-08 06:29:38,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:38,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689984396] [2025-03-08 06:29:38,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689984396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:38,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:38,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:29:38,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699123314] [2025-03-08 06:29:38,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:38,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:29:38,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:38,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:29:38,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:29:38,792 INFO L87 Difference]: Start difference. First operand 1564 states and 2453 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-08 06:29:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:38,820 INFO L93 Difference]: Finished difference Result 4144 states and 6563 transitions. [2025-03-08 06:29:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:29:38,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:38,827 INFO L225 Difference]: With dead ends: 4144 [2025-03-08 06:29:38,828 INFO L226 Difference]: Without dead ends: 2799 [2025-03-08 06:29:38,829 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-08 06:29:38,830 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:38,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 637 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:29:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2025-03-08 06:29:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2763. [2025-03-08 06:29:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.5658942795076032) internal successors, (4325), 2762 states have internal predecessors, (4325), 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-08 06:29:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4325 transitions. [2025-03-08 06:29:38,871 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4325 transitions. Word has length 109 [2025-03-08 06:29:38,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:38,871 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4325 transitions. [2025-03-08 06:29:38,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-08 06:29:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4325 transitions. [2025-03-08 06:29:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:38,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:38,872 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, 1, 1, 1, 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-08 06:29:38,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:29:38,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:38,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1290100621, now seen corresponding path program 1 times [2025-03-08 06:29:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442624386] [2025-03-08 06:29:38,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:38,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:38,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:38,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:38,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:39,192 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-08 06:29:39,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:39,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442624386] [2025-03-08 06:29:39,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442624386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:39,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:39,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914359792] [2025-03-08 06:29:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:39,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:39,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:39,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:39,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:39,194 INFO L87 Difference]: Start difference. First operand 2763 states and 4325 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:39,519 INFO L93 Difference]: Finished difference Result 5309 states and 8350 transitions. [2025-03-08 06:29:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 109 [2025-03-08 06:29:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:39,527 INFO L225 Difference]: With dead ends: 5309 [2025-03-08 06:29:39,527 INFO L226 Difference]: Without dead ends: 2765 [2025-03-08 06:29:39,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:39,531 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 660 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:39,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1226 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2025-03-08 06:29:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2763. [2025-03-08 06:29:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.562635771180304) internal successors, (4316), 2762 states have internal predecessors, (4316), 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-08 06:29:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4316 transitions. [2025-03-08 06:29:39,580 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4316 transitions. Word has length 109 [2025-03-08 06:29:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:39,581 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4316 transitions. [2025-03-08 06:29:39,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-08 06:29:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4316 transitions. [2025-03-08 06:29:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:39,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:39,583 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, 1, 1, 1, 1, 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-08 06:29:39,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:29:39,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:39,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1369657694, now seen corresponding path program 1 times [2025-03-08 06:29:39,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:39,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765633389] [2025-03-08 06:29:39,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:39,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:39,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:39,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:39,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:39,704 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-08 06:29:39,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765633389] [2025-03-08 06:29:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765633389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:39,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:39,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138974702] [2025-03-08 06:29:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:39,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:39,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:39,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:39,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:39,706 INFO L87 Difference]: Start difference. First operand 2763 states and 4316 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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-08 06:29:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:39,839 INFO L93 Difference]: Finished difference Result 5470 states and 8575 transitions. [2025-03-08 06:29:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:39,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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 110 [2025-03-08 06:29:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:39,846 INFO L225 Difference]: With dead ends: 5470 [2025-03-08 06:29:39,847 INFO L226 Difference]: Without dead ends: 2763 [2025-03-08 06:29:39,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:39,850 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 743 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:39,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 150 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-08 06:29:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-08 06:29:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.5499637943519189) internal successors, (4281), 2762 states have internal predecessors, (4281), 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-08 06:29:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4281 transitions. [2025-03-08 06:29:39,889 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4281 transitions. Word has length 110 [2025-03-08 06:29:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:39,889 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4281 transitions. [2025-03-08 06:29:39,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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-08 06:29:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4281 transitions. [2025-03-08 06:29:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:39,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:39,891 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, 1, 1, 1, 1, 1, 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-08 06:29:39,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:29:39,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:39,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1414332283, now seen corresponding path program 1 times [2025-03-08 06:29:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:39,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346887892] [2025-03-08 06:29:39,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:39,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:39,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:39,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:39,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:39,981 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-08 06:29:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346887892] [2025-03-08 06:29:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346887892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043038423] [2025-03-08 06:29:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:39,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:39,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:39,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:39,982 INFO L87 Difference]: Start difference. First operand 2763 states and 4281 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-08 06:29:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:40,108 INFO L93 Difference]: Finished difference Result 5458 states and 8491 transitions. [2025-03-08 06:29:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:40,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-08 06:29:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:40,115 INFO L225 Difference]: With dead ends: 5458 [2025-03-08 06:29:40,115 INFO L226 Difference]: Without dead ends: 2763 [2025-03-08 06:29:40,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:40,118 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 703 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:40,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 174 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-08 06:29:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-08 06:29:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.5372918175235337) internal successors, (4246), 2762 states have internal predecessors, (4246), 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-08 06:29:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4246 transitions. [2025-03-08 06:29:40,152 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4246 transitions. Word has length 111 [2025-03-08 06:29:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:40,152 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4246 transitions. [2025-03-08 06:29:40,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-08 06:29:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4246 transitions. [2025-03-08 06:29:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:40,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:40,153 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, 1, 1, 1, 1, 1, 1, 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-08 06:29:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:29:40,153 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1152912738, now seen corresponding path program 1 times [2025-03-08 06:29:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164077483] [2025-03-08 06:29:40,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:40,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:40,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:40,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:40,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:40,264 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-08 06:29:40,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:40,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164077483] [2025-03-08 06:29:40,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164077483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:40,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750457959] [2025-03-08 06:29:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:40,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:40,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:40,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:40,265 INFO L87 Difference]: Start difference. First operand 2763 states and 4246 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 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-08 06:29:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:40,382 INFO L93 Difference]: Finished difference Result 5446 states and 8407 transitions. [2025-03-08 06:29:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 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-08 06:29:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:40,392 INFO L225 Difference]: With dead ends: 5446 [2025-03-08 06:29:40,392 INFO L226 Difference]: Without dead ends: 2763 [2025-03-08 06:29:40,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:40,396 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 664 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:40,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 202 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-08 06:29:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-08 06:29:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.5246198406951486) internal successors, (4211), 2762 states have internal predecessors, (4211), 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-08 06:29:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4211 transitions. [2025-03-08 06:29:40,436 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4211 transitions. Word has length 112 [2025-03-08 06:29:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:40,436 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4211 transitions. [2025-03-08 06:29:40,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 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-08 06:29:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4211 transitions. [2025-03-08 06:29:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:29:40,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:40,437 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, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:40,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:29:40,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:40,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash 228299647, now seen corresponding path program 1 times [2025-03-08 06:29:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:40,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273044873] [2025-03-08 06:29:40,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:40,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:29:40,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:29:40,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:40,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:40,556 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-08 06:29:40,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273044873] [2025-03-08 06:29:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273044873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:40,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:40,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442206617] [2025-03-08 06:29:40,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:40,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:40,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:40,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:40,557 INFO L87 Difference]: Start difference. First operand 2763 states and 4211 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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-08 06:29:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:40,668 INFO L93 Difference]: Finished difference Result 5454 states and 8347 transitions. [2025-03-08 06:29:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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 113 [2025-03-08 06:29:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:40,674 INFO L225 Difference]: With dead ends: 5454 [2025-03-08 06:29:40,674 INFO L226 Difference]: Without dead ends: 2763 [2025-03-08 06:29:40,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:40,677 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 679 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:40,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 182 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-08 06:29:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-08 06:29:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.5119478638667632) internal successors, (4176), 2762 states have internal predecessors, (4176), 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-08 06:29:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4176 transitions. [2025-03-08 06:29:40,717 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4176 transitions. Word has length 113 [2025-03-08 06:29:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:40,717 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4176 transitions. [2025-03-08 06:29:40,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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-08 06:29:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4176 transitions. [2025-03-08 06:29:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:29:40,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:40,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:40,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:29:40,719 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:40,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1611948994, now seen corresponding path program 1 times [2025-03-08 06:29:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:40,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056275667] [2025-03-08 06:29:40,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:40,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:29:40,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:29:40,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:40,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:40,811 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-08 06:29:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:40,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056275667] [2025-03-08 06:29:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056275667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:40,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:40,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485148920] [2025-03-08 06:29:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:40,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:40,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:40,813 INFO L87 Difference]: Start difference. First operand 2763 states and 4176 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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-08 06:29:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:40,925 INFO L93 Difference]: Finished difference Result 5466 states and 8291 transitions. [2025-03-08 06:29:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:40,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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 114 [2025-03-08 06:29:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:40,929 INFO L225 Difference]: With dead ends: 5466 [2025-03-08 06:29:40,929 INFO L226 Difference]: Without dead ends: 2763 [2025-03-08 06:29:40,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:40,943 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 707 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:40,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 158 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-08 06:29:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-08 06:29:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.499275887038378) internal successors, (4141), 2762 states have internal predecessors, (4141), 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-08 06:29:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4141 transitions. [2025-03-08 06:29:40,982 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4141 transitions. Word has length 114 [2025-03-08 06:29:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:40,982 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4141 transitions. [2025-03-08 06:29:40,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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-08 06:29:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4141 transitions. [2025-03-08 06:29:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 06:29:40,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:40,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:40,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:29:40,983 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:40,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1064258373, now seen corresponding path program 1 times [2025-03-08 06:29:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948008790] [2025-03-08 06:29:40,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:40,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 06:29:41,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 06:29:41,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:41,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:41,075 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-08 06:29:41,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:41,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948008790] [2025-03-08 06:29:41,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948008790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:41,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:41,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64196867] [2025-03-08 06:29:41,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:41,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:41,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:41,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:41,078 INFO L87 Difference]: Start difference. First operand 2763 states and 4141 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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-08 06:29:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:41,187 INFO L93 Difference]: Finished difference Result 5462 states and 8217 transitions. [2025-03-08 06:29:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:41,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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 115 [2025-03-08 06:29:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:41,191 INFO L225 Difference]: With dead ends: 5462 [2025-03-08 06:29:41,191 INFO L226 Difference]: Without dead ends: 2763 [2025-03-08 06:29:41,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:41,193 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 689 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:41,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 166 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-08 06:29:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-08 06:29:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.4866039102099928) internal successors, (4106), 2762 states have internal predecessors, (4106), 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-08 06:29:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4106 transitions. [2025-03-08 06:29:41,227 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4106 transitions. Word has length 115 [2025-03-08 06:29:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:41,227 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4106 transitions. [2025-03-08 06:29:41,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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-08 06:29:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4106 transitions. [2025-03-08 06:29:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 06:29:41,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:41,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:41,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:29:41,229 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:41,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash -772152774, now seen corresponding path program 1 times [2025-03-08 06:29:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807870668] [2025-03-08 06:29:41,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:41,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 06:29:41,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 06:29:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:41,319 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-08 06:29:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807870668] [2025-03-08 06:29:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807870668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:41,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:41,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:41,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354731576] [2025-03-08 06:29:41,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:41,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:41,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:41,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:41,321 INFO L87 Difference]: Start difference. First operand 2763 states and 4106 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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-08 06:29:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:41,431 INFO L93 Difference]: Finished difference Result 5450 states and 8135 transitions. [2025-03-08 06:29:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:41,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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 116 [2025-03-08 06:29:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:41,435 INFO L225 Difference]: With dead ends: 5450 [2025-03-08 06:29:41,436 INFO L226 Difference]: Without dead ends: 2763 [2025-03-08 06:29:41,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:41,439 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 647 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:41,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 190 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-08 06:29:41,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-08 06:29:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.4739319333816074) internal successors, (4071), 2762 states have internal predecessors, (4071), 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-08 06:29:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4071 transitions. [2025-03-08 06:29:41,473 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4071 transitions. Word has length 116 [2025-03-08 06:29:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:41,473 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4071 transitions. [2025-03-08 06:29:41,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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-08 06:29:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4071 transitions. [2025-03-08 06:29:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 06:29:41,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:41,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:41,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:29:41,475 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:41,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:41,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1521594361, now seen corresponding path program 1 times [2025-03-08 06:29:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:41,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056768249] [2025-03-08 06:29:41,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:41,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:41,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 06:29:41,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 06:29:41,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:41,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:41,714 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-08 06:29:41,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:41,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056768249] [2025-03-08 06:29:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056768249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992774893] [2025-03-08 06:29:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:41,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:41,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:41,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:41,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:41,716 INFO L87 Difference]: Start difference. First operand 2763 states and 4071 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 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-08 06:29:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:42,017 INFO L93 Difference]: Finished difference Result 7948 states and 11776 transitions. [2025-03-08 06:29:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 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 117 [2025-03-08 06:29:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:42,025 INFO L225 Difference]: With dead ends: 7948 [2025-03-08 06:29:42,025 INFO L226 Difference]: Without dead ends: 5307 [2025-03-08 06:29:42,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:42,029 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 877 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:42,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 645 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2025-03-08 06:29:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 2763. [2025-03-08 06:29:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.4735698769007965) internal successors, (4070), 2762 states have internal predecessors, (4070), 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-08 06:29:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4070 transitions. [2025-03-08 06:29:42,070 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4070 transitions. Word has length 117 [2025-03-08 06:29:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:42,070 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4070 transitions. [2025-03-08 06:29:42,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 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-08 06:29:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4070 transitions. [2025-03-08 06:29:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 06:29:42,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:42,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:42,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:29:42,072 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:42,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:42,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2031771886, now seen corresponding path program 1 times [2025-03-08 06:29:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:42,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202898187] [2025-03-08 06:29:42,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:42,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 06:29:42,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 06:29:42,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:42,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:42,383 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-08 06:29:42,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:42,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202898187] [2025-03-08 06:29:42,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202898187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:42,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:42,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899986388] [2025-03-08 06:29:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:42,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:42,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:42,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:42,387 INFO L87 Difference]: Start difference. First operand 2763 states and 4070 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 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-08 06:29:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:42,921 INFO L93 Difference]: Finished difference Result 8108 states and 11986 transitions. [2025-03-08 06:29:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:42,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 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 118 [2025-03-08 06:29:42,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:42,932 INFO L225 Difference]: With dead ends: 8108 [2025-03-08 06:29:42,932 INFO L226 Difference]: Without dead ends: 5472 [2025-03-08 06:29:42,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:29:42,935 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1001 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:42,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 857 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2025-03-08 06:29:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 2763. [2025-03-08 06:29:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.4728457639391745) internal successors, (4068), 2762 states have internal predecessors, (4068), 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-08 06:29:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4068 transitions. [2025-03-08 06:29:42,971 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4068 transitions. Word has length 118 [2025-03-08 06:29:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:42,971 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4068 transitions. [2025-03-08 06:29:42,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 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-08 06:29:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4068 transitions. [2025-03-08 06:29:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 06:29:42,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:42,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:42,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:29:42,973 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:42,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1455357356, now seen corresponding path program 1 times [2025-03-08 06:29:42,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:42,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865069179] [2025-03-08 06:29:42,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:42,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:42,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 06:29:42,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 06:29:43,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:43,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:43,190 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-08 06:29:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865069179] [2025-03-08 06:29:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865069179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520151611] [2025-03-08 06:29:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:43,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:43,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:43,192 INFO L87 Difference]: Start difference. First operand 2763 states and 4068 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 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-08 06:29:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:43,601 INFO L93 Difference]: Finished difference Result 8063 states and 11912 transitions. [2025-03-08 06:29:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:43,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 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 118 [2025-03-08 06:29:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:43,610 INFO L225 Difference]: With dead ends: 8063 [2025-03-08 06:29:43,610 INFO L226 Difference]: Without dead ends: 5457 [2025-03-08 06:29:43,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:29:43,614 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 693 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:43,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 689 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2025-03-08 06:29:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 2763. [2025-03-08 06:29:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.4710354815351194) internal successors, (4063), 2762 states have internal predecessors, (4063), 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-08 06:29:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4063 transitions. [2025-03-08 06:29:43,661 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4063 transitions. Word has length 118 [2025-03-08 06:29:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:43,661 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4063 transitions. [2025-03-08 06:29:43,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 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-08 06:29:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4063 transitions. [2025-03-08 06:29:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 06:29:43,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:43,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:43,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:29:43,663 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:43,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1921594631, now seen corresponding path program 1 times [2025-03-08 06:29:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:43,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299497936] [2025-03-08 06:29:43,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:43,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 06:29:43,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 06:29:43,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:43,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:43,901 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-08 06:29:43,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299497936] [2025-03-08 06:29:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299497936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:43,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680733608] [2025-03-08 06:29:43,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:43,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:43,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:43,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:43,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:43,903 INFO L87 Difference]: Start difference. First operand 2763 states and 4063 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 9 states have internal predecessors, (119), 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-08 06:29:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:44,297 INFO L93 Difference]: Finished difference Result 8046 states and 11857 transitions. [2025-03-08 06:29:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:44,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 9 states have internal predecessors, (119), 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 119 [2025-03-08 06:29:44,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:44,305 INFO L225 Difference]: With dead ends: 8046 [2025-03-08 06:29:44,305 INFO L226 Difference]: Without dead ends: 5502 [2025-03-08 06:29:44,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:29:44,309 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1073 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:44,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 691 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5502 states. [2025-03-08 06:29:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5502 to 2787. [2025-03-08 06:29:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2786 states have (on average 1.4698492462311559) internal successors, (4095), 2786 states have internal predecessors, (4095), 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-08 06:29:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 4095 transitions. [2025-03-08 06:29:44,345 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 4095 transitions. Word has length 119 [2025-03-08 06:29:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:44,346 INFO L471 AbstractCegarLoop]: Abstraction has 2787 states and 4095 transitions. [2025-03-08 06:29:44,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 9 states have internal predecessors, (119), 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-08 06:29:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 4095 transitions. [2025-03-08 06:29:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 06:29:44,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:44,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:44,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:29:44,347 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:44,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash -12199740, now seen corresponding path program 1 times [2025-03-08 06:29:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:44,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356444780] [2025-03-08 06:29:44,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:44,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 06:29:44,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 06:29:44,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:44,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:44,630 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-08 06:29:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:44,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356444780] [2025-03-08 06:29:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356444780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:44,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903627133] [2025-03-08 06:29:44,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:44,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:44,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:44,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:44,631 INFO L87 Difference]: Start difference. First operand 2787 states and 4095 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 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-08 06:29:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:45,119 INFO L93 Difference]: Finished difference Result 8159 states and 12035 transitions. [2025-03-08 06:29:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:45,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 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 120 [2025-03-08 06:29:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:45,129 INFO L225 Difference]: With dead ends: 8159 [2025-03-08 06:29:45,129 INFO L226 Difference]: Without dead ends: 5512 [2025-03-08 06:29:45,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:29:45,133 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1141 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:45,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 993 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2025-03-08 06:29:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 2787. [2025-03-08 06:29:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2786 states have (on average 1.468413496051687) internal successors, (4091), 2786 states have internal predecessors, (4091), 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-08 06:29:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 4091 transitions. [2025-03-08 06:29:45,169 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 4091 transitions. Word has length 120 [2025-03-08 06:29:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:45,169 INFO L471 AbstractCegarLoop]: Abstraction has 2787 states and 4091 transitions. [2025-03-08 06:29:45,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 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-08 06:29:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 4091 transitions. [2025-03-08 06:29:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:29:45,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:45,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:45,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:29:45,170 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 497457422, now seen corresponding path program 1 times [2025-03-08 06:29:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892542823] [2025-03-08 06:29:45,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:45,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:29:45,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:29:45,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:45,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:45,241 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-08 06:29:45,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:45,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892542823] [2025-03-08 06:29:45,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892542823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:45,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:45,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:29:45,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539212699] [2025-03-08 06:29:45,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:45,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:29:45,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:45,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:29:45,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:29:45,242 INFO L87 Difference]: Start difference. First operand 2787 states and 4091 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-08 06:29:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:45,272 INFO L93 Difference]: Finished difference Result 7739 states and 11475 transitions. [2025-03-08 06:29:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:29:45,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2025-03-08 06:29:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:45,280 INFO L225 Difference]: With dead ends: 7739 [2025-03-08 06:29:45,280 INFO L226 Difference]: Without dead ends: 5195 [2025-03-08 06:29:45,282 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-08 06:29:45,282 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 134 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:45,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 554 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:29:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5195 states. [2025-03-08 06:29:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5195 to 5057. [2025-03-08 06:29:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5057 states, 5056 states have (on average 1.4669699367088607) internal successors, (7417), 5056 states have internal predecessors, (7417), 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-08 06:29:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5057 states to 5057 states and 7417 transitions. [2025-03-08 06:29:45,322 INFO L78 Accepts]: Start accepts. Automaton has 5057 states and 7417 transitions. Word has length 121 [2025-03-08 06:29:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:45,323 INFO L471 AbstractCegarLoop]: Abstraction has 5057 states and 7417 transitions. [2025-03-08 06:29:45,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-08 06:29:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5057 states and 7417 transitions. [2025-03-08 06:29:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:29:45,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:45,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:45,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:29:45,324 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:45,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2111249394, now seen corresponding path program 1 times [2025-03-08 06:29:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926183907] [2025-03-08 06:29:45,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:45,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:29:45,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:29:45,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:45,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:45,567 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-08 06:29:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926183907] [2025-03-08 06:29:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926183907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:45,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:45,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342715735] [2025-03-08 06:29:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:45,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:45,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:45,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:45,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:45,569 INFO L87 Difference]: Start difference. First operand 5057 states and 7417 transitions. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 9 states have internal predecessors, (121), 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-08 06:29:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:46,103 INFO L93 Difference]: Finished difference Result 14962 states and 21967 transitions. [2025-03-08 06:29:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 9 states have internal predecessors, (121), 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 121 [2025-03-08 06:29:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:46,118 INFO L225 Difference]: With dead ends: 14962 [2025-03-08 06:29:46,118 INFO L226 Difference]: Without dead ends: 10090 [2025-03-08 06:29:46,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:29:46,124 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 953 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:46,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1053 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10090 states. [2025-03-08 06:29:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10090 to 5057. [2025-03-08 06:29:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5057 states, 5056 states have (on average 1.4657832278481013) internal successors, (7411), 5056 states have internal predecessors, (7411), 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-08 06:29:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5057 states to 5057 states and 7411 transitions. [2025-03-08 06:29:46,210 INFO L78 Accepts]: Start accepts. Automaton has 5057 states and 7411 transitions. Word has length 121 [2025-03-08 06:29:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 5057 states and 7411 transitions. [2025-03-08 06:29:46,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 9 states have internal predecessors, (121), 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-08 06:29:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5057 states and 7411 transitions. [2025-03-08 06:29:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:29:46,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:46,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:46,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:29:46,212 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash 893981001, now seen corresponding path program 1 times [2025-03-08 06:29:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224776785] [2025-03-08 06:29:46,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:46,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:29:46,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:29:46,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:46,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:46,418 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-08 06:29:46,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:46,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224776785] [2025-03-08 06:29:46,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224776785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:46,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:46,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335168913] [2025-03-08 06:29:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:46,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:46,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:46,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:46,419 INFO L87 Difference]: Start difference. First operand 5057 states and 7411 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 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-08 06:29:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:46,890 INFO L93 Difference]: Finished difference Result 14907 states and 21873 transitions. [2025-03-08 06:29:46,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:46,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 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 122 [2025-03-08 06:29:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:46,901 INFO L225 Difference]: With dead ends: 14907 [2025-03-08 06:29:46,901 INFO L226 Difference]: Without dead ends: 10065 [2025-03-08 06:29:46,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:29:46,906 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 936 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:46,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1034 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10065 states. [2025-03-08 06:29:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10065 to 5057. [2025-03-08 06:29:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5057 states, 5056 states have (on average 1.4643987341772151) internal successors, (7404), 5056 states have internal predecessors, (7404), 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-08 06:29:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5057 states to 5057 states and 7404 transitions. [2025-03-08 06:29:46,964 INFO L78 Accepts]: Start accepts. Automaton has 5057 states and 7404 transitions. Word has length 122 [2025-03-08 06:29:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:46,964 INFO L471 AbstractCegarLoop]: Abstraction has 5057 states and 7404 transitions. [2025-03-08 06:29:46,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 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-08 06:29:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5057 states and 7404 transitions. [2025-03-08 06:29:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:46,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:46,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:46,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:29:46,965 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:46,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash -874864490, now seen corresponding path program 1 times [2025-03-08 06:29:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130880293] [2025-03-08 06:29:46,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:46,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:47,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:47,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:47,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:47,617 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-08 06:29:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130880293] [2025-03-08 06:29:47,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130880293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:47,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:29:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425131953] [2025-03-08 06:29:47,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:47,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:29:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:47,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:29:47,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:47,619 INFO L87 Difference]: Start difference. First operand 5057 states and 7404 transitions. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 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-08 06:29:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:48,102 INFO L93 Difference]: Finished difference Result 11113 states and 16332 transitions. [2025-03-08 06:29:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 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 123 [2025-03-08 06:29:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:48,114 INFO L225 Difference]: With dead ends: 11113 [2025-03-08 06:29:48,114 INFO L226 Difference]: Without dead ends: 9941 [2025-03-08 06:29:48,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:29:48,116 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 1323 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:48,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1510 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9941 states. [2025-03-08 06:29:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9941 to 5038. [2025-03-08 06:29:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5038 states, 5037 states have (on average 1.46416517768513) internal successors, (7375), 5037 states have internal predecessors, (7375), 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-08 06:29:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5038 states to 5038 states and 7375 transitions. [2025-03-08 06:29:48,176 INFO L78 Accepts]: Start accepts. Automaton has 5038 states and 7375 transitions. Word has length 123 [2025-03-08 06:29:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:48,177 INFO L471 AbstractCegarLoop]: Abstraction has 5038 states and 7375 transitions. [2025-03-08 06:29:48,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 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-08 06:29:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5038 states and 7375 transitions. [2025-03-08 06:29:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:48,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:48,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:48,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:29:48,179 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:48,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1476853751, now seen corresponding path program 1 times [2025-03-08 06:29:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:48,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37686072] [2025-03-08 06:29:48,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:48,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:48,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:48,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:48,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:48,684 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-08 06:29:48,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:48,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37686072] [2025-03-08 06:29:48,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37686072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:48,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:48,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:29:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616810074] [2025-03-08 06:29:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:48,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:29:48,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:48,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:29:48,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:48,687 INFO L87 Difference]: Start difference. First operand 5038 states and 7375 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 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-08 06:29:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:49,386 INFO L93 Difference]: Finished difference Result 20842 states and 30673 transitions. [2025-03-08 06:29:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:29:49,386 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 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 123 [2025-03-08 06:29:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:49,404 INFO L225 Difference]: With dead ends: 20842 [2025-03-08 06:29:49,404 INFO L226 Difference]: Without dead ends: 19660 [2025-03-08 06:29:49,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:29:49,410 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 1111 mSDsluCounter, 4771 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 5413 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:49,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 5413 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:49,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19660 states. [2025-03-08 06:29:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19660 to 5004. [2025-03-08 06:29:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 5003 states have (on average 1.464921047371577) internal successors, (7329), 5003 states have internal predecessors, (7329), 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-08 06:29:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 7329 transitions. [2025-03-08 06:29:49,524 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 7329 transitions. Word has length 123 [2025-03-08 06:29:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:49,524 INFO L471 AbstractCegarLoop]: Abstraction has 5004 states and 7329 transitions. [2025-03-08 06:29:49,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 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-08 06:29:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 7329 transitions. [2025-03-08 06:29:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:49,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:49,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:29:49,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:29:49,525 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:49,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash 398503081, now seen corresponding path program 1 times [2025-03-08 06:29:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:49,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157621956] [2025-03-08 06:29:49,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:49,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:49,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:49,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:49,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:49,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:52,734 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-08 06:29:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157621956] [2025-03-08 06:29:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157621956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2025-03-08 06:29:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332165644] [2025-03-08 06:29:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:52,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 06:29:52,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:52,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 06:29:52,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1917, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 06:29:52,736 INFO L87 Difference]: Start difference. First operand 5004 states and 7329 transitions. Second operand has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 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-08 06:30:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:02,245 INFO L93 Difference]: Finished difference Result 39665 states and 58443 transitions. [2025-03-08 06:30:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 06:30:02,245 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 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 123 [2025-03-08 06:30:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:02,285 INFO L225 Difference]: With dead ends: 39665 [2025-03-08 06:30:02,285 INFO L226 Difference]: Without dead ends: 39097 [2025-03-08 06:30:02,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1037, Invalid=6445, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 06:30:02,298 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 2642 mSDsluCounter, 18732 mSDsCounter, 0 mSdLazyCounter, 13362 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2642 SdHoareTripleChecker+Valid, 19526 SdHoareTripleChecker+Invalid, 13386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 13362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:02,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2642 Valid, 19526 Invalid, 13386 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 13362 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-08 06:30:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39097 states. [2025-03-08 06:30:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39097 to 5059. [2025-03-08 06:30:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5059 states, 5058 states have (on average 1.4634242783708975) internal successors, (7402), 5058 states have internal predecessors, (7402), 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-08 06:30:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 7402 transitions. [2025-03-08 06:30:02,533 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 7402 transitions. Word has length 123 [2025-03-08 06:30:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:02,534 INFO L471 AbstractCegarLoop]: Abstraction has 5059 states and 7402 transitions. [2025-03-08 06:30:02,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 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-08 06:30:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 7402 transitions. [2025-03-08 06:30:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:30:02,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:02,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:02,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:30:02,535 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:02,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 21726081, now seen corresponding path program 1 times [2025-03-08 06:30:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:02,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959051035] [2025-03-08 06:30:02,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:02,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:30:02,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:30:02,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:02,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:03,048 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-08 06:30:03,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:03,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959051035] [2025-03-08 06:30:03,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959051035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:03,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:03,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:30:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515008709] [2025-03-08 06:30:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:03,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:30:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:03,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:30:03,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:30:03,050 INFO L87 Difference]: Start difference. First operand 5059 states and 7402 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 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-08 06:30:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:03,607 INFO L93 Difference]: Finished difference Result 20752 states and 30552 transitions. [2025-03-08 06:30:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:30:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 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 123 [2025-03-08 06:30:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:03,624 INFO L225 Difference]: With dead ends: 20752 [2025-03-08 06:30:03,625 INFO L226 Difference]: Without dead ends: 19584 [2025-03-08 06:30:03,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:30:03,632 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 1286 mSDsluCounter, 3145 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:03,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 3622 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19584 states. [2025-03-08 06:30:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19584 to 5038. [2025-03-08 06:30:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5038 states, 5037 states have (on average 1.462973992455827) internal successors, (7369), 5037 states have internal predecessors, (7369), 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-08 06:30:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5038 states to 5038 states and 7369 transitions. [2025-03-08 06:30:03,744 INFO L78 Accepts]: Start accepts. Automaton has 5038 states and 7369 transitions. Word has length 123 [2025-03-08 06:30:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:03,744 INFO L471 AbstractCegarLoop]: Abstraction has 5038 states and 7369 transitions. [2025-03-08 06:30:03,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 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-08 06:30:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5038 states and 7369 transitions. [2025-03-08 06:30:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:30:03,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:03,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:03,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:30:03,745 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:03,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash -379638183, now seen corresponding path program 1 times [2025-03-08 06:30:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:03,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997087046] [2025-03-08 06:30:03,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:03,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:30:03,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:30:03,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:03,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:04,500 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-08 06:30:04,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:04,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997087046] [2025-03-08 06:30:04,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997087046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:04,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:04,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 06:30:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098770324] [2025-03-08 06:30:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:04,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 06:30:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:04,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 06:30:04,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:04,502 INFO L87 Difference]: Start difference. First operand 5038 states and 7369 transitions. Second operand has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 19 states have internal predecessors, (123), 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-08 06:30:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:05,665 INFO L93 Difference]: Finished difference Result 15924 states and 23418 transitions. [2025-03-08 06:30:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 06:30:05,666 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 19 states have internal predecessors, (123), 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 123 [2025-03-08 06:30:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:05,677 INFO L225 Difference]: With dead ends: 15924 [2025-03-08 06:30:05,677 INFO L226 Difference]: Without dead ends: 14761 [2025-03-08 06:30:05,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 06:30:05,681 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 1285 mSDsluCounter, 4355 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 4802 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:05,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 4802 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:30:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14761 states. [2025-03-08 06:30:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14761 to 5022. [2025-03-08 06:30:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5022 states, 5021 states have (on average 1.4630551682931687) internal successors, (7346), 5021 states have internal predecessors, (7346), 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-08 06:30:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 7346 transitions. [2025-03-08 06:30:05,752 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 7346 transitions. Word has length 123 [2025-03-08 06:30:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:05,752 INFO L471 AbstractCegarLoop]: Abstraction has 5022 states and 7346 transitions. [2025-03-08 06:30:05,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 19 states have internal predecessors, (123), 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-08 06:30:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 7346 transitions. [2025-03-08 06:30:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:30:05,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:05,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:05,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:30:05,753 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:05,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:05,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1282090721, now seen corresponding path program 1 times [2025-03-08 06:30:05,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:05,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305552312] [2025-03-08 06:30:05,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:05,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:05,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:30:05,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:30:05,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:05,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:06,108 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-08 06:30:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:06,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305552312] [2025-03-08 06:30:06,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305552312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:06,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:30:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781355831] [2025-03-08 06:30:06,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:06,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:30:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:06,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:30:06,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:30:06,109 INFO L87 Difference]: Start difference. First operand 5022 states and 7346 transitions. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 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-08 06:30:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:06,507 INFO L93 Difference]: Finished difference Result 20649 states and 30415 transitions. [2025-03-08 06:30:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:30:06,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 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 123 [2025-03-08 06:30:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:06,526 INFO L225 Difference]: With dead ends: 20649 [2025-03-08 06:30:06,526 INFO L226 Difference]: Without dead ends: 19472 [2025-03-08 06:30:06,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:30:06,534 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1485 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:06,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 2098 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19472 states. [2025-03-08 06:30:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19472 to 4983. [2025-03-08 06:30:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4982 states have (on average 1.4646728221597751) internal successors, (7297), 4982 states have internal predecessors, (7297), 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-08 06:30:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 7297 transitions. [2025-03-08 06:30:06,635 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 7297 transitions. Word has length 123 [2025-03-08 06:30:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:06,635 INFO L471 AbstractCegarLoop]: Abstraction has 4983 states and 7297 transitions. [2025-03-08 06:30:06,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 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-08 06:30:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 7297 transitions. [2025-03-08 06:30:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:30:06,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:06,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:06,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:30:06,636 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:06,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2032136526, now seen corresponding path program 1 times [2025-03-08 06:30:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174133035] [2025-03-08 06:30:06,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:06,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:30:06,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:30:06,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:06,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:07,063 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-08 06:30:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174133035] [2025-03-08 06:30:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174133035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:07,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:30:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519993305] [2025-03-08 06:30:07,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:07,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:30:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:07,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:30:07,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:30:07,065 INFO L87 Difference]: Start difference. First operand 4983 states and 7297 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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-08 06:30:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:07,563 INFO L93 Difference]: Finished difference Result 10940 states and 16096 transitions. [2025-03-08 06:30:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:30:07,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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 124 [2025-03-08 06:30:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:07,572 INFO L225 Difference]: With dead ends: 10940 [2025-03-08 06:30:07,572 INFO L226 Difference]: Without dead ends: 9792 [2025-03-08 06:30:07,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:30:07,576 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 860 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:07,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2267 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2025-03-08 06:30:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 4948. [2025-03-08 06:30:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4948 states, 4947 states have (on average 1.466141095613503) internal successors, (7253), 4947 states have internal predecessors, (7253), 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-08 06:30:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 7253 transitions. [2025-03-08 06:30:07,633 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 7253 transitions. Word has length 124 [2025-03-08 06:30:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:07,633 INFO L471 AbstractCegarLoop]: Abstraction has 4948 states and 7253 transitions. [2025-03-08 06:30:07,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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-08 06:30:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 7253 transitions. [2025-03-08 06:30:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:30:07,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:07,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:07,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:30:07,634 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:07,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -278484014, now seen corresponding path program 1 times [2025-03-08 06:30:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487346118] [2025-03-08 06:30:07,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:07,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:30:07,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:30:07,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:07,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:10,002 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-08 06:30:10,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:10,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487346118] [2025-03-08 06:30:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487346118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:10,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2025-03-08 06:30:10,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827094468] [2025-03-08 06:30:10,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:10,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 06:30:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:10,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 06:30:10,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 06:30:10,004 INFO L87 Difference]: Start difference. First operand 4948 states and 7253 transitions. Second operand has 45 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 45 states have internal predecessors, (124), 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-08 06:30:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:17,930 INFO L93 Difference]: Finished difference Result 39956 states and 58911 transitions. [2025-03-08 06:30:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 06:30:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 45 states have internal predecessors, (124), 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 124 [2025-03-08 06:30:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:17,968 INFO L225 Difference]: With dead ends: 39956 [2025-03-08 06:30:17,968 INFO L226 Difference]: Without dead ends: 38822 [2025-03-08 06:30:17,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1022, Invalid=6118, Unknown=0, NotChecked=0, Total=7140 [2025-03-08 06:30:17,981 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 2787 mSDsluCounter, 18494 mSDsCounter, 0 mSdLazyCounter, 12111 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2787 SdHoareTripleChecker+Valid, 19339 SdHoareTripleChecker+Invalid, 12134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:17,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2787 Valid, 19339 Invalid, 12134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12111 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 06:30:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38822 states. [2025-03-08 06:30:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38822 to 4974. [2025-03-08 06:30:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4974 states, 4973 states have (on average 1.4649105167906695) internal successors, (7285), 4973 states have internal predecessors, (7285), 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-08 06:30:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 7285 transitions. [2025-03-08 06:30:18,173 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 7285 transitions. Word has length 124 [2025-03-08 06:30:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:18,173 INFO L471 AbstractCegarLoop]: Abstraction has 4974 states and 7285 transitions. [2025-03-08 06:30:18,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 45 states have internal predecessors, (124), 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-08 06:30:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 7285 transitions. [2025-03-08 06:30:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:30:18,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:18,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:18,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:30:18,174 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:18,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1806514987, now seen corresponding path program 1 times [2025-03-08 06:30:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:18,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348311221] [2025-03-08 06:30:18,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:18,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:30:18,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:30:18,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:18,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:18,270 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-08 06:30:18,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348311221] [2025-03-08 06:30:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348311221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:18,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:18,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:30:18,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196845549] [2025-03-08 06:30:18,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:18,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:30:18,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:18,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:30:18,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:30:18,272 INFO L87 Difference]: Start difference. First operand 4974 states and 7285 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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-08 06:30:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:18,307 INFO L93 Difference]: Finished difference Result 11876 states and 17490 transitions. [2025-03-08 06:30:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:30:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 124 [2025-03-08 06:30:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:18,312 INFO L225 Difference]: With dead ends: 11876 [2025-03-08 06:30:18,312 INFO L226 Difference]: Without dead ends: 7062 [2025-03-08 06:30:18,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:30:18,316 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 115 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:18,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 587 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:30:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2025-03-08 06:30:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 7030. [2025-03-08 06:30:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7030 states, 7029 states have (on average 1.4613743064447289) internal successors, (10272), 7029 states have internal predecessors, (10272), 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-08 06:30:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 10272 transitions. [2025-03-08 06:30:18,367 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 10272 transitions. Word has length 124 [2025-03-08 06:30:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:18,367 INFO L471 AbstractCegarLoop]: Abstraction has 7030 states and 10272 transitions. [2025-03-08 06:30:18,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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-08 06:30:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 10272 transitions. [2025-03-08 06:30:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:30:18,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:18,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:18,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:30:18,368 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:18,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1774310916, now seen corresponding path program 1 times [2025-03-08 06:30:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:18,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606335635] [2025-03-08 06:30:18,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:18,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:18,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:30:18,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:30:18,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:18,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:18,519 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-08 06:30:18,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:18,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606335635] [2025-03-08 06:30:18,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606335635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:18,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:30:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184174001] [2025-03-08 06:30:18,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:18,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:30:18,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:18,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:30:18,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:30:18,521 INFO L87 Difference]: Start difference. First operand 7030 states and 10272 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-08 06:30:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:18,545 INFO L93 Difference]: Finished difference Result 7064 states and 10321 transitions. [2025-03-08 06:30:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:30:18,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 124 [2025-03-08 06:30:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:18,551 INFO L225 Difference]: With dead ends: 7064 [2025-03-08 06:30:18,551 INFO L226 Difference]: Without dead ends: 7062 [2025-03-08 06:30:18,552 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-08 06:30:18,553 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 961 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-08 06:30:18,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 961 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:30:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2025-03-08 06:30:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 7062. [2025-03-08 06:30:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7062 states, 7061 states have (on average 1.4544682056365954) internal successors, (10270), 7061 states have internal predecessors, (10270), 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-08 06:30:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7062 states to 7062 states and 10270 transitions. [2025-03-08 06:30:18,610 INFO L78 Accepts]: Start accepts. Automaton has 7062 states and 10270 transitions. Word has length 124 [2025-03-08 06:30:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:18,610 INFO L471 AbstractCegarLoop]: Abstraction has 7062 states and 10270 transitions. [2025-03-08 06:30:18,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-08 06:30:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7062 states and 10270 transitions. [2025-03-08 06:30:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:30:18,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:18,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:18,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:30:18,611 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:18,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash -301676390, now seen corresponding path program 1 times [2025-03-08 06:30:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:18,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358492484] [2025-03-08 06:30:18,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:18,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:18,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:30:18,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:30:18,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:18,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:19,125 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-08 06:30:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358492484] [2025-03-08 06:30:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358492484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:19,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:19,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:30:19,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000783663] [2025-03-08 06:30:19,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:19,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:30:19,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:19,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:30:19,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:30:19,127 INFO L87 Difference]: Start difference. First operand 7062 states and 10270 transitions. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 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-08 06:30:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:19,701 INFO L93 Difference]: Finished difference Result 29474 states and 43057 transitions. [2025-03-08 06:30:19,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:30:19,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 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 124 [2025-03-08 06:30:19,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:19,726 INFO L225 Difference]: With dead ends: 29474 [2025-03-08 06:30:19,726 INFO L226 Difference]: Without dead ends: 27784 [2025-03-08 06:30:19,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:30:19,735 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 860 mSDsluCounter, 4243 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 4788 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:19,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 4788 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27784 states. [2025-03-08 06:30:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27784 to 7040. [2025-03-08 06:30:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7040 states, 7039 states have (on average 1.4553203580053984) internal successors, (10244), 7039 states have internal predecessors, (10244), 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-08 06:30:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7040 states to 7040 states and 10244 transitions. [2025-03-08 06:30:19,925 INFO L78 Accepts]: Start accepts. Automaton has 7040 states and 10244 transitions. Word has length 124 [2025-03-08 06:30:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:19,925 INFO L471 AbstractCegarLoop]: Abstraction has 7040 states and 10244 transitions. [2025-03-08 06:30:19,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 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-08 06:30:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7040 states and 10244 transitions. [2025-03-08 06:30:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:30:19,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:19,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:30:19,926 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:19,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2100473558, now seen corresponding path program 1 times [2025-03-08 06:30:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892441674] [2025-03-08 06:30:19,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:19,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:30:19,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:30:19,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:19,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:20,776 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-08 06:30:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:20,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892441674] [2025-03-08 06:30:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892441674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:20,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 06:30:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063100904] [2025-03-08 06:30:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:20,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 06:30:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:20,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 06:30:20,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:20,779 INFO L87 Difference]: Start difference. First operand 7040 states and 10244 transitions. Second operand has 19 states, 19 states have (on average 6.578947368421052) internal successors, (125), 19 states have internal predecessors, (125), 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-08 06:30:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:22,502 INFO L93 Difference]: Finished difference Result 36401 states and 53178 transitions. [2025-03-08 06:30:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 06:30:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.578947368421052) internal successors, (125), 19 states have internal predecessors, (125), 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 125 [2025-03-08 06:30:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:22,555 INFO L225 Difference]: With dead ends: 36401 [2025-03-08 06:30:22,555 INFO L226 Difference]: Without dead ends: 34691 [2025-03-08 06:30:22,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 06:30:22,566 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1523 mSDsluCounter, 7677 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 8354 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:22,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 8354 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:30:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34691 states. [2025-03-08 06:30:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34691 to 7024. [2025-03-08 06:30:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7024 states, 7023 states have (on average 1.4559305140253453) internal successors, (10225), 7023 states have internal predecessors, (10225), 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-08 06:30:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7024 states to 7024 states and 10225 transitions. [2025-03-08 06:30:22,743 INFO L78 Accepts]: Start accepts. Automaton has 7024 states and 10225 transitions. Word has length 125 [2025-03-08 06:30:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:22,743 INFO L471 AbstractCegarLoop]: Abstraction has 7024 states and 10225 transitions. [2025-03-08 06:30:22,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.578947368421052) internal successors, (125), 19 states have internal predecessors, (125), 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-08 06:30:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 7024 states and 10225 transitions. [2025-03-08 06:30:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:22,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:22,745 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:22,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:30:22,745 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:22,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2014751236, now seen corresponding path program 1 times [2025-03-08 06:30:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249935069] [2025-03-08 06:30:22,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:22,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:22,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:22,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:22,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:22,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249935069] [2025-03-08 06:30:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249935069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:30:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769719684] [2025-03-08 06:30:22,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:22,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:30:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:22,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:30:22,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:30:22,910 INFO L87 Difference]: Start difference. First operand 7024 states and 10225 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:23,170 INFO L93 Difference]: Finished difference Result 23911 states and 35135 transitions. [2025-03-08 06:30:23,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:23,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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 160 [2025-03-08 06:30:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:23,185 INFO L225 Difference]: With dead ends: 23911 [2025-03-08 06:30:23,185 INFO L226 Difference]: Without dead ends: 17009 [2025-03-08 06:30:23,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:30:23,193 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1063 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:23,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 621 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17009 states. [2025-03-08 06:30:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17009 to 10391. [2025-03-08 06:30:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10391 states, 10390 states have (on average 1.4574590952839268) internal successors, (15143), 10390 states have internal predecessors, (15143), 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-08 06:30:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10391 states to 10391 states and 15143 transitions. [2025-03-08 06:30:23,338 INFO L78 Accepts]: Start accepts. Automaton has 10391 states and 15143 transitions. Word has length 160 [2025-03-08 06:30:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:23,339 INFO L471 AbstractCegarLoop]: Abstraction has 10391 states and 15143 transitions. [2025-03-08 06:30:23,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 10391 states and 15143 transitions. [2025-03-08 06:30:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:23,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:23,340 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:23,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:30:23,340 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:23,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash -207215300, now seen corresponding path program 1 times [2025-03-08 06:30:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112140068] [2025-03-08 06:30:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:23,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:23,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:23,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:23,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:23,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112140068] [2025-03-08 06:30:23,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112140068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:23,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:23,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:30:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982733051] [2025-03-08 06:30:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:23,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:30:23,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:23,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:30:23,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:30:23,462 INFO L87 Difference]: Start difference. First operand 10391 states and 15143 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:23,720 INFO L93 Difference]: Finished difference Result 43035 states and 63209 transitions. [2025-03-08 06:30:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:23,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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 160 [2025-03-08 06:30:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:23,749 INFO L225 Difference]: With dead ends: 43035 [2025-03-08 06:30:23,749 INFO L226 Difference]: Without dead ends: 32785 [2025-03-08 06:30:23,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:30:23,763 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1417 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:23,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 488 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32785 states. [2025-03-08 06:30:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32785 to 21959. [2025-03-08 06:30:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21959 states, 21958 states have (on average 1.4564623371891794) internal successors, (31981), 21958 states have internal predecessors, (31981), 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-08 06:30:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21959 states to 21959 states and 31981 transitions. [2025-03-08 06:30:24,041 INFO L78 Accepts]: Start accepts. Automaton has 21959 states and 31981 transitions. Word has length 160 [2025-03-08 06:30:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:24,041 INFO L471 AbstractCegarLoop]: Abstraction has 21959 states and 31981 transitions. [2025-03-08 06:30:24,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 21959 states and 31981 transitions. [2025-03-08 06:30:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:24,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:24,043 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:24,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:30:24,044 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:24,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash 850171004, now seen corresponding path program 1 times [2025-03-08 06:30:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:24,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965949133] [2025-03-08 06:30:24,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:24,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:24,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:24,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:24,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:24,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:24,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:24,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965949133] [2025-03-08 06:30:24,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965949133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:24,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:30:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911943710] [2025-03-08 06:30:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:24,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:30:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:24,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:30:24,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:30:24,176 INFO L87 Difference]: Start difference. First operand 21959 states and 31981 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:24,582 INFO L93 Difference]: Finished difference Result 84603 states and 123887 transitions. [2025-03-08 06:30:24,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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 160 [2025-03-08 06:30:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:24,640 INFO L225 Difference]: With dead ends: 84603 [2025-03-08 06:30:24,640 INFO L226 Difference]: Without dead ends: 62785 [2025-03-08 06:30:24,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:30:24,652 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1332 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:24,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 486 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62785 states. [2025-03-08 06:30:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62785 to 46415. [2025-03-08 06:30:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46415 states, 46414 states have (on average 1.454410307234886) internal successors, (67505), 46414 states have internal predecessors, (67505), 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-08 06:30:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46415 states to 46415 states and 67505 transitions. [2025-03-08 06:30:25,136 INFO L78 Accepts]: Start accepts. Automaton has 46415 states and 67505 transitions. Word has length 160 [2025-03-08 06:30:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:25,136 INFO L471 AbstractCegarLoop]: Abstraction has 46415 states and 67505 transitions. [2025-03-08 06:30:25,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 46415 states and 67505 transitions. [2025-03-08 06:30:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:25,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:25,138 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:25,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:30:25,139 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -630467684, now seen corresponding path program 1 times [2025-03-08 06:30:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025384423] [2025-03-08 06:30:25,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:25,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:25,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:25,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025384423] [2025-03-08 06:30:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025384423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:25,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:25,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:30:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56204767] [2025-03-08 06:30:25,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:25,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:30:25,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:25,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:30:25,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:30:25,241 INFO L87 Difference]: Start difference. First operand 46415 states and 67505 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:25,715 INFO L93 Difference]: Finished difference Result 166419 states and 242867 transitions. [2025-03-08 06:30:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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 160 [2025-03-08 06:30:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:25,995 INFO L225 Difference]: With dead ends: 166419 [2025-03-08 06:30:25,996 INFO L226 Difference]: Without dead ends: 120145 [2025-03-08 06:30:26,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:30:26,052 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1247 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:26,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 484 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:30:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120145 states. [2025-03-08 06:30:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120145 to 97967. [2025-03-08 06:30:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97967 states, 97966 states have (on average 1.4520241716513893) internal successors, (142249), 97966 states have internal predecessors, (142249), 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-08 06:30:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97967 states to 97967 states and 142249 transitions. [2025-03-08 06:30:27,299 INFO L78 Accepts]: Start accepts. Automaton has 97967 states and 142249 transitions. Word has length 160 [2025-03-08 06:30:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:27,299 INFO L471 AbstractCegarLoop]: Abstraction has 97967 states and 142249 transitions. [2025-03-08 06:30:27,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 97967 states and 142249 transitions. [2025-03-08 06:30:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:27,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:27,302 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:27,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:30:27,302 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:27,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash -913421444, now seen corresponding path program 1 times [2025-03-08 06:30:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185084187] [2025-03-08 06:30:27,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:27,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:27,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:27,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:27,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185084187] [2025-03-08 06:30:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185084187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:30:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005565773] [2025-03-08 06:30:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:27,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:30:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:27,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:30:27,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:30:27,406 INFO L87 Difference]: Start difference. First operand 97967 states and 142249 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:28,332 INFO L93 Difference]: Finished difference Result 327411 states and 476075 transitions. [2025-03-08 06:30:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:28,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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 160 [2025-03-08 06:30:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:28,612 INFO L225 Difference]: With dead ends: 327411 [2025-03-08 06:30:28,612 INFO L226 Difference]: Without dead ends: 229585 [2025-03-08 06:30:28,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:30:28,920 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1162 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:28,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 482 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229585 states. [2025-03-08 06:30:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229585 to 206351. [2025-03-08 06:30:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206351 states, 206350 states have (on average 1.449619578386237) internal successors, (299129), 206350 states have internal predecessors, (299129), 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-08 06:30:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206351 states to 206351 states and 299129 transitions. [2025-03-08 06:30:31,804 INFO L78 Accepts]: Start accepts. Automaton has 206351 states and 299129 transitions. Word has length 160 [2025-03-08 06:30:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:31,804 INFO L471 AbstractCegarLoop]: Abstraction has 206351 states and 299129 transitions. [2025-03-08 06:30:31,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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-08 06:30:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 206351 states and 299129 transitions. [2025-03-08 06:30:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:31,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:31,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:31,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:30:31,807 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:31,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:31,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2032494434, now seen corresponding path program 1 times [2025-03-08 06:30:31,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:31,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520505591] [2025-03-08 06:30:31,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:31,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:31,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:31,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:31,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:31,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:32,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520505591] [2025-03-08 06:30:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520505591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:30:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132045322] [2025-03-08 06:30:32,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:32,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:30:32,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:30:32,079 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-08 06:30:32,080 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-08 06:30:32,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:32,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:32,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:30:32,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:30:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:32,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:30:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132045322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:30:32,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:30:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:30:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839132421] [2025-03-08 06:30:32,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:30:32,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:30:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:32,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:30:32,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:30:32,827 INFO L87 Difference]: Start difference. First operand 206351 states and 299129 transitions. Second operand has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 10 states have internal predecessors, (285), 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-08 06:30:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:34,539 INFO L93 Difference]: Finished difference Result 644115 states and 932987 transitions. [2025-03-08 06:30:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:34,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 10 states have internal predecessors, (285), 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 160 [2025-03-08 06:30:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:35,493 INFO L225 Difference]: With dead ends: 644115 [2025-03-08 06:30:35,493 INFO L226 Difference]: Without dead ends: 437905 [2025-03-08 06:30:35,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 310 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:30:35,575 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1146 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:35,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 559 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437905 states. [2025-03-08 06:30:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437905 to 427343. [2025-03-08 06:30:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427343 states, 427342 states have (on average 1.4440728971175312) internal successors, (617113), 427342 states have internal predecessors, (617113), 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-08 06:30:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427343 states to 427343 states and 617113 transitions. [2025-03-08 06:30:41,461 INFO L78 Accepts]: Start accepts. Automaton has 427343 states and 617113 transitions. Word has length 160 [2025-03-08 06:30:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:41,462 INFO L471 AbstractCegarLoop]: Abstraction has 427343 states and 617113 transitions. [2025-03-08 06:30:41,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 10 states have internal predecessors, (285), 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-08 06:30:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 427343 states and 617113 transitions. [2025-03-08 06:30:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:41,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:41,467 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:30:41,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:30:41,667 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,SelfDestructingSolverStorable42 [2025-03-08 06:30:41,667 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:41,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 728801412, now seen corresponding path program 1 times [2025-03-08 06:30:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886164951] [2025-03-08 06:30:41,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:41,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:41,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:41,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:41,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:42,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886164951] [2025-03-08 06:30:42,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886164951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:42,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:42,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:30:42,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369277391] [2025-03-08 06:30:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:42,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:30:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:42,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:30:42,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:30:42,143 INFO L87 Difference]: Start difference. First operand 427343 states and 617113 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-08 06:30:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:44,129 INFO L93 Difference]: Finished difference Result 754227 states and 1089307 transitions. [2025-03-08 06:30:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:30:44,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 160 [2025-03-08 06:30:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:45,282 INFO L225 Difference]: With dead ends: 754227 [2025-03-08 06:30:45,282 INFO L226 Difference]: Without dead ends: 415376 [2025-03-08 06:30:45,394 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-08 06:30:45,395 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 108 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:45,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 535 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:30:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415376 states.