./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.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 db03244f437c604118fe4e6b7fad5fed51908f88ca97b14f50d7801b4370610e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:15:42,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:15:42,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:15:42,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:15:42,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:15:42,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:15:42,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:15:42,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:15:42,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:15:42,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:15:42,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:15:42,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:15:42,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:15:42,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:15:42,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:15:42,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:15:42,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:15:42,754 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 -> db03244f437c604118fe4e6b7fad5fed51908f88ca97b14f50d7801b4370610e [2025-03-03 15:15:42,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:15:42,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:15:42,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:15:42,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:15:42,993 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:15:42,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-03-03 15:15:44,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b1875d7/0c25a406a4134bfa9fd83b09e020be64/FLAG67a617d04 [2025-03-03 15:15:44,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:15:44,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-03-03 15:15:44,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b1875d7/0c25a406a4134bfa9fd83b09e020be64/FLAG67a617d04 [2025-03-03 15:15:44,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b1875d7/0c25a406a4134bfa9fd83b09e020be64 [2025-03-03 15:15:44,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:15:44,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:15:44,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:15:44,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:15:44,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:15:44,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d430d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44, skipping insertion in model container [2025-03-03 15:15:44,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:15:44,705 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.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[9243,9256] [2025-03-03 15:15:44,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:15:44,754 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:15:44,808 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.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[9243,9256] [2025-03-03 15:15:44,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:15:44,871 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:15:44,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44 WrapperNode [2025-03-03 15:15:44,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:15:44,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:15:44,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:15:44,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:15:44,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,929 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 811 [2025-03-03 15:15:44,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:15:44,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:15:44,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:15:44,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:15:44,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,973 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-03 15:15:44,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:15:44,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:15:44,993 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:15:44,993 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:15:44,994 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (1/1) ... [2025-03-03 15:15:44,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:15:45,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:15:45,021 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-03 15:15:45,026 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-03 15:15:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:15:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:15:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:15:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:15:45,132 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:15:45,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:15:45,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: havoc main_~node2__m2~2#1; [2025-03-03 15:15:45,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L499: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~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_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~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-03 15:15:45,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L702: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L838: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L657: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: havoc main_~node5__m5~2#1; [2025-03-03 15:15:45,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L792: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node4__m4~2#1; [2025-03-03 15:15:45,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L612: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~2#1; [2025-03-03 15:15:45,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: havoc main_~node3__m3~2#1; [2025-03-03 15:15:45,689 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-03-03 15:15:45,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:15:45,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:15:45,698 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:15:45,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:15:45 BoogieIcfgContainer [2025-03-03 15:15:45,698 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:15:45,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:15:45,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:15:45,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:15:45,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:15:44" (1/3) ... [2025-03-03 15:15:45,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403bf007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:15:45, skipping insertion in model container [2025-03-03 15:15:45,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:44" (2/3) ... [2025-03-03 15:15:45,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403bf007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:15:45, skipping insertion in model container [2025-03-03 15:15:45,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:15:45" (3/3) ... [2025-03-03 15:15:45,705 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-03-03 15:15:45,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:15:45,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c that has 1 procedures, 178 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:15:45,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:15:45,761 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;@7e2301ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:15:45,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:15:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 176 states have (on average 1.7613636363636365) internal successors, (310), 177 states have internal predecessors, (310), 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-03 15:15:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:15:45,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:45,774 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] [2025-03-03 15:15:45,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:45,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1268562021, now seen corresponding path program 1 times [2025-03-03 15:15:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:45,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318772766] [2025-03-03 15:15:45,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:45,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:45,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:15:45,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:15:45,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:45,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:46,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-03 15:15:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318772766] [2025-03-03 15:15:46,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318772766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:46,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:46,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487554757] [2025-03-03 15:15:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:46,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:46,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:46,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:46,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:46,407 INFO L87 Difference]: Start difference. First operand has 178 states, 176 states have (on average 1.7613636363636365) internal successors, (310), 177 states have internal predecessors, (310), 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 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-03 15:15:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:46,904 INFO L93 Difference]: Finished difference Result 1147 states and 1843 transitions. [2025-03-03 15:15:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:46,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 91 [2025-03-03 15:15:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:46,921 INFO L225 Difference]: With dead ends: 1147 [2025-03-03 15:15:46,921 INFO L226 Difference]: Without dead ends: 1037 [2025-03-03 15:15:46,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:15:46,925 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1804 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 5433 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:46,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 5433 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-03-03 15:15:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 270. [2025-03-03 15:15:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.449814126394052) internal successors, (390), 269 states have internal predecessors, (390), 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-03 15:15:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 390 transitions. [2025-03-03 15:15:46,973 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 390 transitions. Word has length 91 [2025-03-03 15:15:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:46,974 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 390 transitions. [2025-03-03 15:15:46,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-03 15:15:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 390 transitions. [2025-03-03 15:15:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:15:46,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:46,978 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] [2025-03-03 15:15:46,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:15:46,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:46,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1851530711, now seen corresponding path program 1 times [2025-03-03 15:15:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:46,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912443710] [2025-03-03 15:15:46,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:47,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:15:47,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:15:47,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:47,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:47,292 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-03 15:15:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912443710] [2025-03-03 15:15:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912443710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:47,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106102067] [2025-03-03 15:15:47,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:47,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:47,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:47,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:47,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:47,294 INFO L87 Difference]: Start difference. First operand 270 states and 390 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:47,511 INFO L93 Difference]: Finished difference Result 1236 states and 1911 transitions. [2025-03-03 15:15:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:47,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-03-03 15:15:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:47,515 INFO L225 Difference]: With dead ends: 1236 [2025-03-03 15:15:47,515 INFO L226 Difference]: Without dead ends: 1096 [2025-03-03 15:15:47,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:47,516 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 1241 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:47,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2990 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-03-03 15:15:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 429. [2025-03-03 15:15:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.5) internal successors, (642), 428 states have internal predecessors, (642), 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-03 15:15:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 642 transitions. [2025-03-03 15:15:47,543 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 642 transitions. Word has length 93 [2025-03-03 15:15:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:47,544 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 642 transitions. [2025-03-03 15:15:47,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 642 transitions. [2025-03-03 15:15:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:15:47,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:47,545 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] [2025-03-03 15:15:47,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:15:47,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:47,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1723357729, now seen corresponding path program 1 times [2025-03-03 15:15:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:47,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050953111] [2025-03-03 15:15:47,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:47,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:15:47,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:15:47,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:47,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:47,765 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-03 15:15:47,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050953111] [2025-03-03 15:15:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050953111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:47,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:47,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95607748] [2025-03-03 15:15:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:47,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:47,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:47,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:47,769 INFO L87 Difference]: Start difference. First operand 429 states and 642 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:47,971 INFO L93 Difference]: Finished difference Result 1395 states and 2163 transitions. [2025-03-03 15:15:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-03-03 15:15:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:47,977 INFO L225 Difference]: With dead ends: 1395 [2025-03-03 15:15:47,977 INFO L226 Difference]: Without dead ends: 1255 [2025-03-03 15:15:47,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:47,981 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1234 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:47,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 2527 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-03 15:15:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 657. [2025-03-03 15:15:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.5289634146341464) internal successors, (1003), 656 states have internal predecessors, (1003), 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-03 15:15:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1003 transitions. [2025-03-03 15:15:48,014 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1003 transitions. Word has length 93 [2025-03-03 15:15:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:48,014 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1003 transitions. [2025-03-03 15:15:48,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1003 transitions. [2025-03-03 15:15:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:15:48,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:48,015 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] [2025-03-03 15:15:48,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:15:48,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:48,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:48,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1046455593, now seen corresponding path program 1 times [2025-03-03 15:15:48,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:48,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597696094] [2025-03-03 15:15:48,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:48,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:48,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:15:48,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:15:48,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:48,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:48,229 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-03 15:15:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:48,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597696094] [2025-03-03 15:15:48,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597696094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:48,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:48,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:48,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112184786] [2025-03-03 15:15:48,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:48,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:48,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:48,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:48,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:48,231 INFO L87 Difference]: Start difference. First operand 657 states and 1003 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:48,419 INFO L93 Difference]: Finished difference Result 1549 states and 2407 transitions. [2025-03-03 15:15:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:48,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-03-03 15:15:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:48,424 INFO L225 Difference]: With dead ends: 1549 [2025-03-03 15:15:48,424 INFO L226 Difference]: Without dead ends: 1409 [2025-03-03 15:15:48,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:48,425 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 1339 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:48,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 2254 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-03-03 15:15:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 811. [2025-03-03 15:15:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.539506172839506) internal successors, (1247), 810 states have internal predecessors, (1247), 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-03 15:15:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1247 transitions. [2025-03-03 15:15:48,467 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1247 transitions. Word has length 93 [2025-03-03 15:15:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:48,467 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1247 transitions. [2025-03-03 15:15:48,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1247 transitions. [2025-03-03 15:15:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:15:48,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:48,469 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] [2025-03-03 15:15:48,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:15:48,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:48,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1169459423, now seen corresponding path program 1 times [2025-03-03 15:15:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:48,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143532702] [2025-03-03 15:15:48,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:48,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:15:48,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:15:48,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:48,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:48,631 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-03 15:15:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143532702] [2025-03-03 15:15:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143532702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930251443] [2025-03-03 15:15:48,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:48,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:48,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:48,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:48,633 INFO L87 Difference]: Start difference. First operand 811 states and 1247 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:48,849 INFO L93 Difference]: Finished difference Result 1698 states and 2643 transitions. [2025-03-03 15:15:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-03-03 15:15:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:48,854 INFO L225 Difference]: With dead ends: 1698 [2025-03-03 15:15:48,854 INFO L226 Difference]: Without dead ends: 1558 [2025-03-03 15:15:48,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:48,856 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1441 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:48,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 2375 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-03-03 15:15:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 960. [2025-03-03 15:15:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.5464025026068822) internal successors, (1483), 959 states have internal predecessors, (1483), 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-03 15:15:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1483 transitions. [2025-03-03 15:15:48,876 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1483 transitions. Word has length 93 [2025-03-03 15:15:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:48,876 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1483 transitions. [2025-03-03 15:15:48,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1483 transitions. [2025-03-03 15:15:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:15:48,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:48,877 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] [2025-03-03 15:15:48,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:15:48,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:48,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:48,878 INFO L85 PathProgramCache]: Analyzing trace with hash 132753449, now seen corresponding path program 1 times [2025-03-03 15:15:48,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:48,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085475612] [2025-03-03 15:15:48,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:48,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:15:48,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:15:48,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:48,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:49,025 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-03 15:15:49,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:49,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085475612] [2025-03-03 15:15:49,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085475612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:49,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:49,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252127541] [2025-03-03 15:15:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:49,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:49,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:49,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:49,027 INFO L87 Difference]: Start difference. First operand 960 states and 1483 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:49,213 INFO L93 Difference]: Finished difference Result 1842 states and 2871 transitions. [2025-03-03 15:15:49,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:49,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-03-03 15:15:49,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:49,219 INFO L225 Difference]: With dead ends: 1842 [2025-03-03 15:15:49,219 INFO L226 Difference]: Without dead ends: 1702 [2025-03-03 15:15:49,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:49,222 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 1544 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:49,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 2378 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-03-03 15:15:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1104. [2025-03-03 15:15:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 1.5512239347234815) internal successors, (1711), 1103 states have internal predecessors, (1711), 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-03 15:15:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1711 transitions. [2025-03-03 15:15:49,251 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1711 transitions. Word has length 93 [2025-03-03 15:15:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:49,251 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1711 transitions. [2025-03-03 15:15:49,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1711 transitions. [2025-03-03 15:15:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:15:49,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:49,253 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] [2025-03-03 15:15:49,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:15:49,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:49,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1917299679, now seen corresponding path program 1 times [2025-03-03 15:15:49,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:49,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253448518] [2025-03-03 15:15:49,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:49,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:49,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:15:49,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:15:49,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:49,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:49,416 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-03 15:15:49,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:49,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253448518] [2025-03-03 15:15:49,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253448518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:49,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:49,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:49,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092189744] [2025-03-03 15:15:49,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:49,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:49,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:49,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:49,418 INFO L87 Difference]: Start difference. First operand 1104 states and 1711 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:49,585 INFO L93 Difference]: Finished difference Result 1981 states and 3091 transitions. [2025-03-03 15:15:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:49,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-03-03 15:15:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:49,591 INFO L225 Difference]: With dead ends: 1981 [2025-03-03 15:15:49,591 INFO L226 Difference]: Without dead ends: 1841 [2025-03-03 15:15:49,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:49,593 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1644 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 2549 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:49,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 2549 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-03-03 15:15:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1243. [2025-03-03 15:15:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.5547504025764896) internal successors, (1931), 1242 states have internal predecessors, (1931), 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-03 15:15:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1931 transitions. [2025-03-03 15:15:49,626 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1931 transitions. Word has length 93 [2025-03-03 15:15:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:49,626 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1931 transitions. [2025-03-03 15:15:49,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1931 transitions. [2025-03-03 15:15:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:15:49,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:49,628 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] [2025-03-03 15:15:49,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:15:49,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:49,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash -643577554, now seen corresponding path program 1 times [2025-03-03 15:15:49,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:49,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401989850] [2025-03-03 15:15:49,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:49,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:49,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:15:49,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:15:49,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:49,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:49,687 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-03 15:15:49,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401989850] [2025-03-03 15:15:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401989850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:49,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:49,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:49,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929893317] [2025-03-03 15:15:49,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:49,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:49,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:49,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:49,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:49,689 INFO L87 Difference]: Start difference. First operand 1243 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03 15:15:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:49,715 INFO L93 Difference]: Finished difference Result 3220 states and 5048 transitions. [2025-03-03 15:15:49,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2025-03-03 15:15:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:49,721 INFO L225 Difference]: With dead ends: 3220 [2025-03-03 15:15:49,722 INFO L226 Difference]: Without dead ends: 2183 [2025-03-03 15:15:49,723 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-03 15:15:49,723 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 99 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:49,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 562 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2025-03-03 15:15:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2181. [2025-03-03 15:15:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.5472477064220183) internal successors, (3373), 2180 states have internal predecessors, (3373), 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-03 15:15:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3373 transitions. [2025-03-03 15:15:49,763 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3373 transitions. Word has length 93 [2025-03-03 15:15:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:49,763 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3373 transitions. [2025-03-03 15:15:49,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03 15:15:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3373 transitions. [2025-03-03 15:15:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:15:49,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:49,764 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] [2025-03-03 15:15:49,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:15:49,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:49,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:49,765 INFO L85 PathProgramCache]: Analyzing trace with hash -642415705, now seen corresponding path program 1 times [2025-03-03 15:15:49,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:49,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824981038] [2025-03-03 15:15:49,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:49,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:49,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:15:49,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:15:49,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:49,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:50,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-03 15:15:50,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824981038] [2025-03-03 15:15:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824981038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:50,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:50,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577273175] [2025-03-03 15:15:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:50,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:50,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:50,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:50,051 INFO L87 Difference]: Start difference. First operand 2181 states and 3373 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:50,259 INFO L93 Difference]: Finished difference Result 4158 states and 6460 transitions. [2025-03-03 15:15:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-03-03 15:15:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:50,266 INFO L225 Difference]: With dead ends: 4158 [2025-03-03 15:15:50,266 INFO L226 Difference]: Without dead ends: 2183 [2025-03-03 15:15:50,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:50,269 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 448 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:50,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 948 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2025-03-03 15:15:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2181. [2025-03-03 15:15:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.5435779816513762) internal successors, (3365), 2180 states have internal predecessors, (3365), 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-03 15:15:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3365 transitions. [2025-03-03 15:15:50,326 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3365 transitions. Word has length 93 [2025-03-03 15:15:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:50,327 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3365 transitions. [2025-03-03 15:15:50,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03 15:15:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3365 transitions. [2025-03-03 15:15:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:15:50,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:50,331 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] [2025-03-03 15:15:50,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:15:50,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:50,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1528705574, now seen corresponding path program 1 times [2025-03-03 15:15:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:50,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357591331] [2025-03-03 15:15:50,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:50,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:50,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:15:50,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:15:50,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:50,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:50,432 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-03 15:15:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:50,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357591331] [2025-03-03 15:15:50,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357591331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:50,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:50,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:50,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699791010] [2025-03-03 15:15:50,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:50,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:50,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:50,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:50,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:50,433 INFO L87 Difference]: Start difference. First operand 2181 states and 3365 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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-03 15:15:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:50,635 INFO L93 Difference]: Finished difference Result 6387 states and 9911 transitions. [2025-03-03 15:15:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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 94 [2025-03-03 15:15:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:50,647 INFO L225 Difference]: With dead ends: 6387 [2025-03-03 15:15:50,647 INFO L226 Difference]: Without dead ends: 4253 [2025-03-03 15:15:50,651 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-03 15:15:50,651 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 963 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:50,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 211 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2025-03-03 15:15:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 4251. [2025-03-03 15:15:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.544) internal successors, (6562), 4250 states have internal predecessors, (6562), 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-03 15:15:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6562 transitions. [2025-03-03 15:15:50,722 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6562 transitions. Word has length 94 [2025-03-03 15:15:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:50,723 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6562 transitions. [2025-03-03 15:15:50,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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-03 15:15:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6562 transitions. [2025-03-03 15:15:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:15:50,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:50,724 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] [2025-03-03 15:15:50,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:15:50,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:50,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1430804925, now seen corresponding path program 1 times [2025-03-03 15:15:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111641899] [2025-03-03 15:15:50,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:50,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:15:50,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:15:50,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:50,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:50,831 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-03 15:15:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111641899] [2025-03-03 15:15:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111641899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:50,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:50,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476936871] [2025-03-03 15:15:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:50,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:50,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:50,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:50,833 INFO L87 Difference]: Start difference. First operand 4251 states and 6562 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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-03 15:15:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:50,965 INFO L93 Difference]: Finished difference Result 8443 states and 13062 transitions. [2025-03-03 15:15:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-03-03 15:15:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:50,976 INFO L225 Difference]: With dead ends: 8443 [2025-03-03 15:15:50,977 INFO L226 Difference]: Without dead ends: 4251 [2025-03-03 15:15:50,981 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-03 15:15:50,982 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 622 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:50,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 155 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2025-03-03 15:15:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4251. [2025-03-03 15:15:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.5296470588235294) internal successors, (6501), 4250 states have internal predecessors, (6501), 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-03 15:15:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6501 transitions. [2025-03-03 15:15:51,051 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6501 transitions. Word has length 95 [2025-03-03 15:15:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:51,051 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6501 transitions. [2025-03-03 15:15:51,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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-03 15:15:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6501 transitions. [2025-03-03 15:15:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:15:51,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:51,052 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] [2025-03-03 15:15:51,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:15:51,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:51,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:51,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1090126934, now seen corresponding path program 1 times [2025-03-03 15:15:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:51,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423525883] [2025-03-03 15:15:51,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:51,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:51,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:15:51,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:15:51,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:51,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:51,170 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-03 15:15:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423525883] [2025-03-03 15:15:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423525883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:51,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:51,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:51,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124787994] [2025-03-03 15:15:51,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:51,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:51,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:51,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:51,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:51,171 INFO L87 Difference]: Start difference. First operand 4251 states and 6501 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-03 15:15:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:51,305 INFO L93 Difference]: Finished difference Result 8439 states and 12936 transitions. [2025-03-03 15:15:51,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2025-03-03 15:15:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:51,322 INFO L225 Difference]: With dead ends: 8439 [2025-03-03 15:15:51,325 INFO L226 Difference]: Without dead ends: 4251 [2025-03-03 15:15:51,330 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-03 15:15:51,330 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 604 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:51,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 163 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2025-03-03 15:15:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4251. [2025-03-03 15:15:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.515294117647059) internal successors, (6440), 4250 states have internal predecessors, (6440), 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-03 15:15:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6440 transitions. [2025-03-03 15:15:51,408 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6440 transitions. Word has length 96 [2025-03-03 15:15:51,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:51,408 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6440 transitions. [2025-03-03 15:15:51,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-03 15:15:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6440 transitions. [2025-03-03 15:15:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:15:51,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:51,409 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] [2025-03-03 15:15:51,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:15:51,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 100140473, now seen corresponding path program 1 times [2025-03-03 15:15:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913790029] [2025-03-03 15:15:51,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:51,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:15:51,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:15:51,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:51,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:51,489 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-03 15:15:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913790029] [2025-03-03 15:15:51,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913790029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:51,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:51,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:51,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655064349] [2025-03-03 15:15:51,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:51,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:51,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:51,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:51,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:51,490 INFO L87 Difference]: Start difference. First operand 4251 states and 6440 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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-03 15:15:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:51,609 INFO L93 Difference]: Finished difference Result 8451 states and 12828 transitions. [2025-03-03 15:15:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-03-03 15:15:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:51,616 INFO L225 Difference]: With dead ends: 8451 [2025-03-03 15:15:51,617 INFO L226 Difference]: Without dead ends: 4251 [2025-03-03 15:15:51,622 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-03 15:15:51,622 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 632 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:51,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 139 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2025-03-03 15:15:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4251. [2025-03-03 15:15:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.5009411764705882) internal successors, (6379), 4250 states have internal predecessors, (6379), 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-03 15:15:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6379 transitions. [2025-03-03 15:15:51,706 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6379 transitions. Word has length 97 [2025-03-03 15:15:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6379 transitions. [2025-03-03 15:15:51,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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-03 15:15:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6379 transitions. [2025-03-03 15:15:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:15:51,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:51,708 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] [2025-03-03 15:15:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:15:51,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:51,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1164418330, now seen corresponding path program 1 times [2025-03-03 15:15:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736696656] [2025-03-03 15:15:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:51,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:15:51,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:15:51,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:51,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:51,791 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-03 15:15:51,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:51,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736696656] [2025-03-03 15:15:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736696656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:51,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:51,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671812289] [2025-03-03 15:15:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:51,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:51,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:51,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:51,793 INFO L87 Difference]: Start difference. First operand 4251 states and 6379 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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-03 15:15:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:51,910 INFO L93 Difference]: Finished difference Result 8447 states and 12702 transitions. [2025-03-03 15:15:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:51,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 98 [2025-03-03 15:15:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:51,921 INFO L225 Difference]: With dead ends: 8447 [2025-03-03 15:15:51,922 INFO L226 Difference]: Without dead ends: 4251 [2025-03-03 15:15:51,928 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-03 15:15:51,928 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 614 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:51,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 147 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2025-03-03 15:15:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4251. [2025-03-03 15:15:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.4865882352941175) internal successors, (6318), 4250 states have internal predecessors, (6318), 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-03 15:15:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6318 transitions. [2025-03-03 15:15:51,992 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6318 transitions. Word has length 98 [2025-03-03 15:15:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:51,993 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6318 transitions. [2025-03-03 15:15:51,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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-03 15:15:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6318 transitions. [2025-03-03 15:15:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:15:51,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:51,994 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] [2025-03-03 15:15:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:15:51,995 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1740046923, now seen corresponding path program 1 times [2025-03-03 15:15:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94717763] [2025-03-03 15:15:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:52,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:15:52,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:15:52,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:52,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:52,096 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-03 15:15:52,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:52,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94717763] [2025-03-03 15:15:52,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94717763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:52,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:52,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:52,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357978239] [2025-03-03 15:15:52,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:52,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:52,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:52,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:52,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:52,098 INFO L87 Difference]: Start difference. First operand 4251 states and 6318 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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-03 15:15:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:52,216 INFO L93 Difference]: Finished difference Result 8435 states and 12568 transitions. [2025-03-03 15:15:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 99 [2025-03-03 15:15:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:52,222 INFO L225 Difference]: With dead ends: 8435 [2025-03-03 15:15:52,223 INFO L226 Difference]: Without dead ends: 4251 [2025-03-03 15:15:52,227 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-03 15:15:52,229 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 572 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:52,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 171 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2025-03-03 15:15:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4251. [2025-03-03 15:15:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.472235294117647) internal successors, (6257), 4250 states have internal predecessors, (6257), 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-03 15:15:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6257 transitions. [2025-03-03 15:15:52,280 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6257 transitions. Word has length 99 [2025-03-03 15:15:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:52,281 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6257 transitions. [2025-03-03 15:15:52,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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-03 15:15:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6257 transitions. [2025-03-03 15:15:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:15:52,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:52,283 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] [2025-03-03 15:15:52,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:15:52,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 896259122, now seen corresponding path program 1 times [2025-03-03 15:15:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154522546] [2025-03-03 15:15:52,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:52,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:52,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:15:52,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:15:52,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:52,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:52,540 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-03 15:15:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154522546] [2025-03-03 15:15:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154522546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:52,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:52,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323744413] [2025-03-03 15:15:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:52,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:52,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:52,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:52,542 INFO L87 Difference]: Start difference. First operand 4251 states and 6257 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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-03 15:15:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:52,864 INFO L93 Difference]: Finished difference Result 12257 states and 18071 transitions. [2025-03-03 15:15:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:15:52,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2025-03-03 15:15:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:52,876 INFO L225 Difference]: With dead ends: 12257 [2025-03-03 15:15:52,877 INFO L226 Difference]: Without dead ends: 8212 [2025-03-03 15:15:52,882 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-03 15:15:52,883 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 825 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:52,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 546 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8212 states. [2025-03-03 15:15:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8212 to 4251. [2025-03-03 15:15:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.472) internal successors, (6256), 4250 states have internal predecessors, (6256), 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-03 15:15:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6256 transitions. [2025-03-03 15:15:52,949 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6256 transitions. Word has length 100 [2025-03-03 15:15:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:52,949 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6256 transitions. [2025-03-03 15:15:52,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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-03 15:15:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6256 transitions. [2025-03-03 15:15:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:15:52,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:52,951 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] [2025-03-03 15:15:52,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:15:52,951 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:52,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1224555943, now seen corresponding path program 1 times [2025-03-03 15:15:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549997902] [2025-03-03 15:15:52,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:52,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:15:52,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:15:52,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:52,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:53,234 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-03 15:15:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549997902] [2025-03-03 15:15:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549997902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:15:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905142764] [2025-03-03 15:15:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:15:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:53,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:15:53,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:15:53,237 INFO L87 Difference]: Start difference. First operand 4251 states and 6256 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 9 states have internal predecessors, (101), 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-03 15:15:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:53,666 INFO L93 Difference]: Finished difference Result 12348 states and 18140 transitions. [2025-03-03 15:15:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:53,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 9 states have internal predecessors, (101), 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 101 [2025-03-03 15:15:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:53,680 INFO L225 Difference]: With dead ends: 12348 [2025-03-03 15:15:53,680 INFO L226 Difference]: Without dead ends: 8387 [2025-03-03 15:15:53,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:15:53,686 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 592 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:53,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 606 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8387 states. [2025-03-03 15:15:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8387 to 4251. [2025-03-03 15:15:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.4689411764705882) internal successors, (6243), 4250 states have internal predecessors, (6243), 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-03 15:15:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6243 transitions. [2025-03-03 15:15:53,754 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6243 transitions. Word has length 101 [2025-03-03 15:15:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:53,754 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6243 transitions. [2025-03-03 15:15:53,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 9 states have internal predecessors, (101), 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-03 15:15:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6243 transitions. [2025-03-03 15:15:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:15:53,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:53,756 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] [2025-03-03 15:15:53,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:15:53,756 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:53,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash -570246055, now seen corresponding path program 1 times [2025-03-03 15:15:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:53,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235101922] [2025-03-03 15:15:53,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:53,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:53,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:15:53,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:15:53,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:53,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:54,143 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-03 15:15:54,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235101922] [2025-03-03 15:15:54,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235101922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:54,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:54,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:15:54,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512897152] [2025-03-03 15:15:54,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:54,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:15:54,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:54,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:15:54,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:15:54,145 INFO L87 Difference]: Start difference. First operand 4251 states and 6243 transitions. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 13 states have internal predecessors, (101), 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-03 15:15:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:54,775 INFO L93 Difference]: Finished difference Result 12715 states and 18585 transitions. [2025-03-03 15:15:54,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:15:54,775 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 13 states have internal predecessors, (101), 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 101 [2025-03-03 15:15:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:54,788 INFO L225 Difference]: With dead ends: 12715 [2025-03-03 15:15:54,788 INFO L226 Difference]: Without dead ends: 8666 [2025-03-03 15:15:54,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:15:54,794 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 993 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:54,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1188 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8666 states. [2025-03-03 15:15:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8666 to 4260. [2025-03-03 15:15:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4260 states, 4259 states have (on average 1.4679502230570556) internal successors, (6252), 4259 states have internal predecessors, (6252), 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-03 15:15:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 6252 transitions. [2025-03-03 15:15:54,873 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 6252 transitions. Word has length 101 [2025-03-03 15:15:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:54,873 INFO L471 AbstractCegarLoop]: Abstraction has 4260 states and 6252 transitions. [2025-03-03 15:15:54,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 13 states have internal predecessors, (101), 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-03 15:15:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 6252 transitions. [2025-03-03 15:15:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:15:54,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:54,874 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] [2025-03-03 15:15:54,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:15:54,874 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:54,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:54,875 INFO L85 PathProgramCache]: Analyzing trace with hash 47063465, now seen corresponding path program 1 times [2025-03-03 15:15:54,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:54,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180631593] [2025-03-03 15:15:54,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:54,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:54,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:15:54,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:15:54,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:54,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:55,099 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-03 15:15:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180631593] [2025-03-03 15:15:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180631593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:55,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:55,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:15:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921094457] [2025-03-03 15:15:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:55,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:15:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:55,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:15:55,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:15:55,101 INFO L87 Difference]: Start difference. First operand 4260 states and 6252 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 9 states have internal predecessors, (102), 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-03 15:15:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:55,485 INFO L93 Difference]: Finished difference Result 12577 states and 18466 transitions. [2025-03-03 15:15:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 9 states have internal predecessors, (102), 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 102 [2025-03-03 15:15:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:55,498 INFO L225 Difference]: With dead ends: 12577 [2025-03-03 15:15:55,498 INFO L226 Difference]: Without dead ends: 8486 [2025-03-03 15:15:55,503 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-03 15:15:55,503 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 937 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:55,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 603 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2025-03-03 15:15:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4251. [2025-03-03 15:15:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4250 states have (on average 1.467529411764706) internal successors, (6237), 4250 states have internal predecessors, (6237), 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-03 15:15:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6237 transitions. [2025-03-03 15:15:55,578 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6237 transitions. Word has length 102 [2025-03-03 15:15:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:55,578 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6237 transitions. [2025-03-03 15:15:55,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 9 states have internal predecessors, (102), 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-03 15:15:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6237 transitions. [2025-03-03 15:15:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:15:55,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:55,580 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] [2025-03-03 15:15:55,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:15:55,580 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:55,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash 508541137, now seen corresponding path program 1 times [2025-03-03 15:15:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309308831] [2025-03-03 15:15:55,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:55,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:15:55,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:15:55,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:55,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:55,877 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-03 15:15:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309308831] [2025-03-03 15:15:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309308831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:55,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:55,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:15:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094858438] [2025-03-03 15:15:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:55,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:15:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:55,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:15:55,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:15:55,879 INFO L87 Difference]: Start difference. First operand 4251 states and 6237 transitions. Second operand has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 13 states have internal predecessors, (102), 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-03 15:15:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:56,570 INFO L93 Difference]: Finished difference Result 12718 states and 18576 transitions. [2025-03-03 15:15:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:15:56,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 13 states have internal predecessors, (102), 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 102 [2025-03-03 15:15:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:56,585 INFO L225 Difference]: With dead ends: 12718 [2025-03-03 15:15:56,585 INFO L226 Difference]: Without dead ends: 8684 [2025-03-03 15:15:56,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:15:56,591 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 956 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:56,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1145 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:15:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8684 states. [2025-03-03 15:15:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8684 to 4284. [2025-03-03 15:15:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4284 states, 4283 states have (on average 1.465328041092692) internal successors, (6276), 4283 states have internal predecessors, (6276), 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-03 15:15:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4284 states to 4284 states and 6276 transitions. [2025-03-03 15:15:56,674 INFO L78 Accepts]: Start accepts. Automaton has 4284 states and 6276 transitions. Word has length 102 [2025-03-03 15:15:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:56,674 INFO L471 AbstractCegarLoop]: Abstraction has 4284 states and 6276 transitions. [2025-03-03 15:15:56,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 13 states have internal predecessors, (102), 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-03 15:15:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4284 states and 6276 transitions. [2025-03-03 15:15:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:15:56,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:56,676 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] [2025-03-03 15:15:56,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:15:56,676 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:56,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1829700223, now seen corresponding path program 1 times [2025-03-03 15:15:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:56,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304680225] [2025-03-03 15:15:56,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:56,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:15:56,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:15:56,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:56,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:57,112 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-03 15:15:57,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304680225] [2025-03-03 15:15:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304680225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:57,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:15:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075648615] [2025-03-03 15:15:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:57,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:15:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:57,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:15:57,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:57,115 INFO L87 Difference]: Start difference. First operand 4284 states and 6276 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 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-03 15:15:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:58,065 INFO L93 Difference]: Finished difference Result 27544 states and 40281 transitions. [2025-03-03 15:15:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:15:58,065 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 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 103 [2025-03-03 15:15:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:58,096 INFO L225 Difference]: With dead ends: 27544 [2025-03-03 15:15:58,097 INFO L226 Difference]: Without dead ends: 23483 [2025-03-03 15:15:58,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:15:58,108 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 1824 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:58,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 1307 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:15:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23483 states. [2025-03-03 15:15:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23483 to 4284. [2025-03-03 15:15:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4284 states, 4283 states have (on average 1.464627597478403) internal successors, (6273), 4283 states have internal predecessors, (6273), 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-03 15:15:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4284 states to 4284 states and 6273 transitions. [2025-03-03 15:15:58,242 INFO L78 Accepts]: Start accepts. Automaton has 4284 states and 6273 transitions. Word has length 103 [2025-03-03 15:15:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:58,242 INFO L471 AbstractCegarLoop]: Abstraction has 4284 states and 6273 transitions. [2025-03-03 15:15:58,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 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-03 15:15:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4284 states and 6273 transitions. [2025-03-03 15:15:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:15:58,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:58,244 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] [2025-03-03 15:15:58,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:15:58,244 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:58,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash 471090481, now seen corresponding path program 1 times [2025-03-03 15:15:58,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:58,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688849932] [2025-03-03 15:15:58,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:58,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:15:58,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:15:58,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:58,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:58,461 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-03 15:15:58,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:58,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688849932] [2025-03-03 15:15:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688849932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:15:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799499744] [2025-03-03 15:15:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:58,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:15:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:58,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:15:58,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:15:58,464 INFO L87 Difference]: Start difference. First operand 4284 states and 6273 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 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-03 15:15:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:58,865 INFO L93 Difference]: Finished difference Result 9017 states and 13198 transitions. [2025-03-03 15:15:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 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 103 [2025-03-03 15:15:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:58,872 INFO L225 Difference]: With dead ends: 9017 [2025-03-03 15:15:58,872 INFO L226 Difference]: Without dead ends: 4911 [2025-03-03 15:15:58,875 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-03 15:15:58,877 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 580 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:58,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 723 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2025-03-03 15:15:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4269. [2025-03-03 15:15:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4269 states, 4268 states have (on average 1.4641518275538894) internal successors, (6249), 4268 states have internal predecessors, (6249), 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-03 15:15:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4269 states to 4269 states and 6249 transitions. [2025-03-03 15:15:58,912 INFO L78 Accepts]: Start accepts. Automaton has 4269 states and 6249 transitions. Word has length 103 [2025-03-03 15:15:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:58,912 INFO L471 AbstractCegarLoop]: Abstraction has 4269 states and 6249 transitions. [2025-03-03 15:15:58,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 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-03 15:15:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 6249 transitions. [2025-03-03 15:15:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:15:58,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:58,913 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] [2025-03-03 15:15:58,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:15:58,913 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:58,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1000052353, now seen corresponding path program 1 times [2025-03-03 15:15:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996950796] [2025-03-03 15:15:58,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:58,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:15:58,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:15:58,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:58,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:59,273 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-03 15:15:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996950796] [2025-03-03 15:15:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996950796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:59,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:15:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678330231] [2025-03-03 15:15:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:59,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:15:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:59,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:15:59,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:59,274 INFO L87 Difference]: Start difference. First operand 4269 states and 6249 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 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-03 15:16:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:00,030 INFO L93 Difference]: Finished difference Result 25048 states and 36529 transitions. [2025-03-03 15:16:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:16:00,031 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 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 104 [2025-03-03 15:16:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:00,058 INFO L225 Difference]: With dead ends: 25048 [2025-03-03 15:16:00,059 INFO L226 Difference]: Without dead ends: 21032 [2025-03-03 15:16:00,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:16:00,068 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 2567 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:00,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2567 Valid, 874 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:16:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21032 states. [2025-03-03 15:16:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21032 to 4296. [2025-03-03 15:16:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4296 states, 4295 states have (on average 1.4607683352735739) internal successors, (6274), 4295 states have internal predecessors, (6274), 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-03 15:16:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 6274 transitions. [2025-03-03 15:16:00,199 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 6274 transitions. Word has length 104 [2025-03-03 15:16:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:00,200 INFO L471 AbstractCegarLoop]: Abstraction has 4296 states and 6274 transitions. [2025-03-03 15:16:00,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 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-03 15:16:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 6274 transitions. [2025-03-03 15:16:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:16:00,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:00,201 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] [2025-03-03 15:16:00,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:16:00,201 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:00,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash -345018453, now seen corresponding path program 1 times [2025-03-03 15:16:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:00,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310337160] [2025-03-03 15:16:00,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:00,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:16:00,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:16:00,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:00,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:00,388 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-03 15:16:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310337160] [2025-03-03 15:16:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310337160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:00,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:00,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:16:00,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387480671] [2025-03-03 15:16:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:00,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:16:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:00,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:16:00,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:16:00,389 INFO L87 Difference]: Start difference. First operand 4296 states and 6274 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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-03 15:16:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:00,872 INFO L93 Difference]: Finished difference Result 12544 states and 18370 transitions. [2025-03-03 15:16:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:16:00,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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 104 [2025-03-03 15:16:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:00,884 INFO L225 Difference]: With dead ends: 12544 [2025-03-03 15:16:00,884 INFO L226 Difference]: Without dead ends: 8510 [2025-03-03 15:16:00,889 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-03 15:16:00,890 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 682 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:00,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 942 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2025-03-03 15:16:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 4278. [2025-03-03 15:16:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4278 states, 4277 states have (on average 1.4613046527940146) internal successors, (6250), 4277 states have internal predecessors, (6250), 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-03 15:16:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 6250 transitions. [2025-03-03 15:16:00,976 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 6250 transitions. Word has length 104 [2025-03-03 15:16:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:00,976 INFO L471 AbstractCegarLoop]: Abstraction has 4278 states and 6250 transitions. [2025-03-03 15:16:00,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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-03 15:16:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 6250 transitions. [2025-03-03 15:16:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:16:00,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:00,977 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] [2025-03-03 15:16:00,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:16:00,977 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:00,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1913638231, now seen corresponding path program 1 times [2025-03-03 15:16:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686342571] [2025-03-03 15:16:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:00,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:16:01,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:16:01,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:01,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:01,431 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-03 15:16:01,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686342571] [2025-03-03 15:16:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686342571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:01,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:16:01,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375075625] [2025-03-03 15:16:01,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:01,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:01,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:01,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:01,432 INFO L87 Difference]: Start difference. First operand 4278 states and 6250 transitions. Second operand has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 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-03 15:16:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:01,793 INFO L93 Difference]: Finished difference Result 9311 states and 13670 transitions. [2025-03-03 15:16:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:16:01,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 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 105 [2025-03-03 15:16:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:01,801 INFO L225 Difference]: With dead ends: 9311 [2025-03-03 15:16:01,801 INFO L226 Difference]: Without dead ends: 8204 [2025-03-03 15:16:01,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:16:01,805 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 863 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:01,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1234 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2025-03-03 15:16:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 4244. [2025-03-03 15:16:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4244 states, 4243 states have (on average 1.4617016262078717) internal successors, (6202), 4243 states have internal predecessors, (6202), 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-03 15:16:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4244 states to 4244 states and 6202 transitions. [2025-03-03 15:16:01,884 INFO L78 Accepts]: Start accepts. Automaton has 4244 states and 6202 transitions. Word has length 105 [2025-03-03 15:16:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:01,885 INFO L471 AbstractCegarLoop]: Abstraction has 4244 states and 6202 transitions. [2025-03-03 15:16:01,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 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-03 15:16:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 6202 transitions. [2025-03-03 15:16:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:16:01,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:01,886 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] [2025-03-03 15:16:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:16:01,886 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash 640709129, now seen corresponding path program 1 times [2025-03-03 15:16:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662217267] [2025-03-03 15:16:01,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:01,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:16:01,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:16:01,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:01,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:02,382 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-03 15:16:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662217267] [2025-03-03 15:16:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662217267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:02,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:02,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:16:02,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847674247] [2025-03-03 15:16:02,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:02,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:16:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:02,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:16:02,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:16:02,384 INFO L87 Difference]: Start difference. First operand 4244 states and 6202 transitions. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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-03 15:16:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:03,131 INFO L93 Difference]: Finished difference Result 17338 states and 25502 transitions. [2025-03-03 15:16:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:16:03,131 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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 105 [2025-03-03 15:16:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:03,145 INFO L225 Difference]: With dead ends: 17338 [2025-03-03 15:16:03,145 INFO L226 Difference]: Without dead ends: 16260 [2025-03-03 15:16:03,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:16:03,150 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1024 mSDsluCounter, 2832 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:03,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 3121 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16260 states. [2025-03-03 15:16:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16260 to 4232. [2025-03-03 15:16:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4232 states, 4231 states have (on average 1.4597021980619238) internal successors, (6176), 4231 states have internal predecessors, (6176), 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-03 15:16:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 6176 transitions. [2025-03-03 15:16:03,229 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 6176 transitions. Word has length 105 [2025-03-03 15:16:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:03,229 INFO L471 AbstractCegarLoop]: Abstraction has 4232 states and 6176 transitions. [2025-03-03 15:16:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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-03 15:16:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 6176 transitions. [2025-03-03 15:16:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:16:03,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:03,230 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] [2025-03-03 15:16:03,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:16:03,230 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:03,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1459839025, now seen corresponding path program 1 times [2025-03-03 15:16:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:03,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710016035] [2025-03-03 15:16:03,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:03,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:16:03,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:16:03,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:03,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:03,656 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-03 15:16:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:03,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710016035] [2025-03-03 15:16:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710016035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:03,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:03,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:16:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926109745] [2025-03-03 15:16:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:03,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:16:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:03,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:16:03,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:03,658 INFO L87 Difference]: Start difference. First operand 4232 states and 6176 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 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-03 15:16:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:04,149 INFO L93 Difference]: Finished difference Result 9336 states and 13690 transitions. [2025-03-03 15:16:04,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:16:04,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 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 105 [2025-03-03 15:16:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:04,156 INFO L225 Difference]: With dead ends: 9336 [2025-03-03 15:16:04,156 INFO L226 Difference]: Without dead ends: 8238 [2025-03-03 15:16:04,159 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-03 15:16:04,159 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 991 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:04,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1788 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:16:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8238 states. [2025-03-03 15:16:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8238 to 4210. [2025-03-03 15:16:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4209 states have (on average 1.4587788073176526) internal successors, (6140), 4209 states have internal predecessors, (6140), 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-03 15:16:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6140 transitions. [2025-03-03 15:16:04,210 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6140 transitions. Word has length 105 [2025-03-03 15:16:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:04,210 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6140 transitions. [2025-03-03 15:16:04,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 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-03 15:16:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6140 transitions. [2025-03-03 15:16:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:16:04,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:04,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] [2025-03-03 15:16:04,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:16:04,212 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:04,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash -354223527, now seen corresponding path program 1 times [2025-03-03 15:16:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:04,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851134529] [2025-03-03 15:16:04,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:04,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:04,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:16:04,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:16:04,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:04,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:04,702 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-03 15:16:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851134529] [2025-03-03 15:16:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851134529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:16:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004613511] [2025-03-03 15:16:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:04,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:16:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:04,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:16:04,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:16:04,704 INFO L87 Difference]: Start difference. First operand 4210 states and 6140 transitions. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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-03 15:16:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:05,433 INFO L93 Difference]: Finished difference Result 17280 states and 25388 transitions. [2025-03-03 15:16:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:16:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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 105 [2025-03-03 15:16:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:05,445 INFO L225 Difference]: With dead ends: 17280 [2025-03-03 15:16:05,445 INFO L226 Difference]: Without dead ends: 16150 [2025-03-03 15:16:05,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:16:05,449 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 995 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:05,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 3091 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:16:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16150 states. [2025-03-03 15:16:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16150 to 4136. [2025-03-03 15:16:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4136 states, 4135 states have (on average 1.4611850060459493) internal successors, (6042), 4135 states have internal predecessors, (6042), 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-03 15:16:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 6042 transitions. [2025-03-03 15:16:05,517 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 6042 transitions. Word has length 105 [2025-03-03 15:16:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:05,517 INFO L471 AbstractCegarLoop]: Abstraction has 4136 states and 6042 transitions. [2025-03-03 15:16:05,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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-03 15:16:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 6042 transitions. [2025-03-03 15:16:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:16:05,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:05,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:05,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:16:05,518 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:05,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:05,518 INFO L85 PathProgramCache]: Analyzing trace with hash -208060287, now seen corresponding path program 1 times [2025-03-03 15:16:05,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347958085] [2025-03-03 15:16:05,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:05,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:05,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:16:05,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:16:05,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:05,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:06,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-03 15:16:06,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:06,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347958085] [2025-03-03 15:16:06,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347958085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:06,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:06,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 15:16:06,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839322080] [2025-03-03 15:16:06,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:06,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 15:16:06,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:06,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 15:16:06,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:06,194 INFO L87 Difference]: Start difference. First operand 4136 states and 6042 transitions. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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-03 15:16:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:07,006 INFO L93 Difference]: Finished difference Result 9228 states and 13536 transitions. [2025-03-03 15:16:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:07,007 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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 105 [2025-03-03 15:16:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:07,013 INFO L225 Difference]: With dead ends: 9228 [2025-03-03 15:16:07,013 INFO L226 Difference]: Without dead ends: 8134 [2025-03-03 15:16:07,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 15:16:07,017 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 661 mSDsluCounter, 3691 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:07,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 4001 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8134 states. [2025-03-03 15:16:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8134 to 4136. [2025-03-03 15:16:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4136 states, 4135 states have (on average 1.4607013301088272) internal successors, (6040), 4135 states have internal predecessors, (6040), 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-03 15:16:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 6040 transitions. [2025-03-03 15:16:07,061 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 6040 transitions. Word has length 105 [2025-03-03 15:16:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:07,061 INFO L471 AbstractCegarLoop]: Abstraction has 4136 states and 6040 transitions. [2025-03-03 15:16:07,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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-03 15:16:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 6040 transitions. [2025-03-03 15:16:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:16:07,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:07,075 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] [2025-03-03 15:16:07,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:16:07,075 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:07,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1309652566, now seen corresponding path program 1 times [2025-03-03 15:16:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:07,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666253678] [2025-03-03 15:16:07,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:07,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:16:07,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:16:07,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:07,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:07,166 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-03 15:16:07,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666253678] [2025-03-03 15:16:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666253678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:16:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374689552] [2025-03-03 15:16:07,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:16:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:07,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:16:07,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:16:07,167 INFO L87 Difference]: Start difference. First operand 4136 states and 6040 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-03 15:16:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:07,194 INFO L93 Difference]: Finished difference Result 9738 states and 14313 transitions. [2025-03-03 15:16:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:16:07,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 106 [2025-03-03 15:16:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:07,199 INFO L225 Difference]: With dead ends: 9738 [2025-03-03 15:16:07,199 INFO L226 Difference]: Without dead ends: 5790 [2025-03-03 15:16:07,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:16:07,202 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 108 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:07,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 523 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5790 states. [2025-03-03 15:16:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5790 to 5788. [2025-03-03 15:16:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5788 states, 5787 states have (on average 1.4596509417660273) internal successors, (8447), 5787 states have internal predecessors, (8447), 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-03 15:16:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 8447 transitions. [2025-03-03 15:16:07,247 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 8447 transitions. Word has length 106 [2025-03-03 15:16:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:07,247 INFO L471 AbstractCegarLoop]: Abstraction has 5788 states and 8447 transitions. [2025-03-03 15:16:07,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-03 15:16:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 8447 transitions. [2025-03-03 15:16:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:16:07,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:07,248 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] [2025-03-03 15:16:07,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:16:07,248 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1277448495, now seen corresponding path program 1 times [2025-03-03 15:16:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077225212] [2025-03-03 15:16:07,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:07,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:16:07,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:16:07,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:07,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:07,385 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-03 15:16:07,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:07,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077225212] [2025-03-03 15:16:07,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077225212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:07,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:07,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:16:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120030156] [2025-03-03 15:16:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:07,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:07,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:07,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:07,387 INFO L87 Difference]: Start difference. First operand 5788 states and 8447 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-03 15:16:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:07,413 INFO L93 Difference]: Finished difference Result 5818 states and 8490 transitions. [2025-03-03 15:16:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:16:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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 106 [2025-03-03 15:16:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:07,418 INFO L225 Difference]: With dead ends: 5818 [2025-03-03 15:16:07,418 INFO L226 Difference]: Without dead ends: 5816 [2025-03-03 15:16:07,419 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-03 15:16:07,420 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:07,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 853 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2025-03-03 15:16:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5816. [2025-03-03 15:16:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5816 states, 5815 states have (on average 1.4522785898538264) internal successors, (8445), 5815 states have internal predecessors, (8445), 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-03 15:16:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5816 states to 5816 states and 8445 transitions. [2025-03-03 15:16:07,461 INFO L78 Accepts]: Start accepts. Automaton has 5816 states and 8445 transitions. Word has length 106 [2025-03-03 15:16:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:07,462 INFO L471 AbstractCegarLoop]: Abstraction has 5816 states and 8445 transitions. [2025-03-03 15:16:07,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-03 15:16:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5816 states and 8445 transitions. [2025-03-03 15:16:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:16:07,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:07,462 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] [2025-03-03 15:16:07,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:16:07,463 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 218378407, now seen corresponding path program 1 times [2025-03-03 15:16:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671856329] [2025-03-03 15:16:07,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:07,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:16:07,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:16:07,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:07,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:09,281 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-03 15:16:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671856329] [2025-03-03 15:16:09,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671856329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:09,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:09,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2025-03-03 15:16:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181722859] [2025-03-03 15:16:09,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:09,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 15:16:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:09,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 15:16:09,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 15:16:09,282 INFO L87 Difference]: Start difference. First operand 5816 states and 8445 transitions. Second operand has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 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-03 15:16:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:12,338 INFO L93 Difference]: Finished difference Result 7153 states and 10399 transitions. [2025-03-03 15:16:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 15:16:12,338 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 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 106 [2025-03-03 15:16:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:12,342 INFO L225 Difference]: With dead ends: 7153 [2025-03-03 15:16:12,342 INFO L226 Difference]: Without dead ends: 5836 [2025-03-03 15:16:12,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=778, Invalid=4478, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 15:16:12,344 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 847 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:12,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 3121 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:16:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5836 states. [2025-03-03 15:16:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5836 to 5833. [2025-03-03 15:16:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5833 states, 5832 states have (on average 1.4516460905349795) internal successors, (8466), 5832 states have internal predecessors, (8466), 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-03 15:16:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 8466 transitions. [2025-03-03 15:16:12,397 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 8466 transitions. Word has length 106 [2025-03-03 15:16:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 5833 states and 8466 transitions. [2025-03-03 15:16:12,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 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-03 15:16:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 8466 transitions. [2025-03-03 15:16:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:16:12,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:12,398 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] [2025-03-03 15:16:12,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:16:12,399 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:12,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1071936963, now seen corresponding path program 1 times [2025-03-03 15:16:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586113556] [2025-03-03 15:16:12,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:12,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:16:12,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:16:12,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:12,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:12,552 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-03 15:16:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586113556] [2025-03-03 15:16:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586113556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:16:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608984461] [2025-03-03 15:16:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:12,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:16:12,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:12,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:16:12,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:16:12,553 INFO L87 Difference]: Start difference. First operand 5833 states and 8466 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 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-03 15:16:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:12,916 INFO L93 Difference]: Finished difference Result 17325 states and 25182 transitions. [2025-03-03 15:16:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:16:12,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 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 106 [2025-03-03 15:16:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:12,925 INFO L225 Difference]: With dead ends: 17325 [2025-03-03 15:16:12,925 INFO L226 Difference]: Without dead ends: 11669 [2025-03-03 15:16:12,929 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-03 15:16:12,929 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 656 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:12,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 915 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11669 states. [2025-03-03 15:16:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11669 to 5821. [2025-03-03 15:16:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5821 states, 5820 states have (on average 1.4518900343642611) internal successors, (8450), 5820 states have internal predecessors, (8450), 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-03 15:16:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5821 states to 5821 states and 8450 transitions. [2025-03-03 15:16:12,988 INFO L78 Accepts]: Start accepts. Automaton has 5821 states and 8450 transitions. Word has length 106 [2025-03-03 15:16:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:12,988 INFO L471 AbstractCegarLoop]: Abstraction has 5821 states and 8450 transitions. [2025-03-03 15:16:12,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 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-03 15:16:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5821 states and 8450 transitions. [2025-03-03 15:16:12,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:16:12,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:12,989 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] [2025-03-03 15:16:12,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:16:12,989 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:12,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash 269709179, now seen corresponding path program 1 times [2025-03-03 15:16:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025518637] [2025-03-03 15:16:12,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:13,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:16:13,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:16:13,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:13,360 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-03 15:16:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025518637] [2025-03-03 15:16:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025518637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:13,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:16:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367892747] [2025-03-03 15:16:13,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:13,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:16:13,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:13,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:16:13,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:13,365 INFO L87 Difference]: Start difference. First operand 5821 states and 8450 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 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-03 15:16:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:13,768 INFO L93 Difference]: Finished difference Result 13043 states and 19011 transitions. [2025-03-03 15:16:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:16:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 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 106 [2025-03-03 15:16:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:13,775 INFO L225 Difference]: With dead ends: 13043 [2025-03-03 15:16:13,775 INFO L226 Difference]: Without dead ends: 11469 [2025-03-03 15:16:13,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:16:13,778 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 908 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:13,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2142 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11469 states. [2025-03-03 15:16:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11469 to 5800. [2025-03-03 15:16:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5800 states, 5799 states have (on average 1.4521469218830834) internal successors, (8421), 5799 states have internal predecessors, (8421), 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-03 15:16:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5800 states to 5800 states and 8421 transitions. [2025-03-03 15:16:13,830 INFO L78 Accepts]: Start accepts. Automaton has 5800 states and 8421 transitions. Word has length 106 [2025-03-03 15:16:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:13,830 INFO L471 AbstractCegarLoop]: Abstraction has 5800 states and 8421 transitions. [2025-03-03 15:16:13,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 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-03 15:16:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5800 states and 8421 transitions. [2025-03-03 15:16:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:16:13,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:13,830 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-03 15:16:13,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:16:13,830 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1661410227, now seen corresponding path program 1 times [2025-03-03 15:16:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879113369] [2025-03-03 15:16:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:13,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:16:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:16:13,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:13,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:14,207 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-03 15:16:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879113369] [2025-03-03 15:16:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879113369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:14,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:16:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770001163] [2025-03-03 15:16:14,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:14,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:16:14,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:14,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:16:14,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:14,209 INFO L87 Difference]: Start difference. First operand 5800 states and 8421 transitions. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 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-03 15:16:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:14,494 INFO L93 Difference]: Finished difference Result 7370 states and 10720 transitions. [2025-03-03 15:16:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:14,494 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 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-03 15:16:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:14,497 INFO L225 Difference]: With dead ends: 7370 [2025-03-03 15:16:14,498 INFO L226 Difference]: Without dead ends: 5758 [2025-03-03 15:16:14,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:16:14,499 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 459 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:14,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1437 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2025-03-03 15:16:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5758. [2025-03-03 15:16:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5758 states, 5757 states have (on average 1.4540559319089803) internal successors, (8371), 5757 states have internal predecessors, (8371), 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-03 15:16:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5758 states to 5758 states and 8371 transitions. [2025-03-03 15:16:14,556 INFO L78 Accepts]: Start accepts. Automaton has 5758 states and 8371 transitions. Word has length 107 [2025-03-03 15:16:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:14,556 INFO L471 AbstractCegarLoop]: Abstraction has 5758 states and 8371 transitions. [2025-03-03 15:16:14,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 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-03 15:16:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5758 states and 8371 transitions. [2025-03-03 15:16:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 15:16:14,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:14,557 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:16:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:16:14,557 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:14,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash -260951627, now seen corresponding path program 1 times [2025-03-03 15:16:14,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176756070] [2025-03-03 15:16:14,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:14,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 15:16:14,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 15:16:14,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:14,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:14,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:14,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176756070] [2025-03-03 15:16:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176756070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:14,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:14,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:14,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982536399] [2025-03-03 15:16:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:14,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:14,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:14,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:14,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:14,624 INFO L87 Difference]: Start difference. First operand 5758 states and 8371 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03 15:16:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:14,647 INFO L93 Difference]: Finished difference Result 11996 states and 17494 transitions. [2025-03-03 15:16:14,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:14,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 138 [2025-03-03 15:16:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:14,652 INFO L225 Difference]: With dead ends: 11996 [2025-03-03 15:16:14,652 INFO L226 Difference]: Without dead ends: 8020 [2025-03-03 15:16:14,654 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-03 15:16:14,655 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 100 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 472 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-03 15:16:14,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 472 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8020 states. [2025-03-03 15:16:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8020 to 7770. [2025-03-03 15:16:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7770 states, 7769 states have (on average 1.4484489638306088) internal successors, (11253), 7769 states have internal predecessors, (11253), 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-03 15:16:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7770 states to 7770 states and 11253 transitions. [2025-03-03 15:16:14,704 INFO L78 Accepts]: Start accepts. Automaton has 7770 states and 11253 transitions. Word has length 138 [2025-03-03 15:16:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:14,704 INFO L471 AbstractCegarLoop]: Abstraction has 7770 states and 11253 transitions. [2025-03-03 15:16:14,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03 15:16:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7770 states and 11253 transitions. [2025-03-03 15:16:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 15:16:14,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:14,705 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:16:14,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:16:14,705 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:14,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1374523549, now seen corresponding path program 1 times [2025-03-03 15:16:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:14,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742598633] [2025-03-03 15:16:14,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:14,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:14,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:16:14,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:16:14,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:14,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742598633] [2025-03-03 15:16:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742598633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:16:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111242550] [2025-03-03 15:16:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:14,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:16:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:14,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:16:14,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:14,793 INFO L87 Difference]: Start difference. First operand 7770 states and 11253 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:15,038 INFO L93 Difference]: Finished difference Result 21072 states and 30749 transitions. [2025-03-03 15:16:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:15,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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 140 [2025-03-03 15:16:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:15,048 INFO L225 Difference]: With dead ends: 21072 [2025-03-03 15:16:15,048 INFO L226 Difference]: Without dead ends: 13450 [2025-03-03 15:16:15,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:15,054 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1045 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:15,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 499 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:16:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13450 states. [2025-03-03 15:16:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13450 to 8328. [2025-03-03 15:16:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8328 states, 8327 states have (on average 1.4444577879188183) internal successors, (12028), 8327 states have internal predecessors, (12028), 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-03 15:16:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8328 states to 8328 states and 12028 transitions. [2025-03-03 15:16:15,120 INFO L78 Accepts]: Start accepts. Automaton has 8328 states and 12028 transitions. Word has length 140 [2025-03-03 15:16:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:15,121 INFO L471 AbstractCegarLoop]: Abstraction has 8328 states and 12028 transitions. [2025-03-03 15:16:15,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 8328 states and 12028 transitions. [2025-03-03 15:16:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 15:16:15,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:15,121 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:16:15,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:16:15,122 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:15,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -206239395, now seen corresponding path program 1 times [2025-03-03 15:16:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903142762] [2025-03-03 15:16:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:15,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:16:15,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:16:15,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:15,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:15,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:15,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903142762] [2025-03-03 15:16:15,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903142762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:15,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:15,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:16:15,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864838466] [2025-03-03 15:16:15,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:15,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:16:15,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:15,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:16:15,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:15,210 INFO L87 Difference]: Start difference. First operand 8328 states and 12028 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:15,423 INFO L93 Difference]: Finished difference Result 34164 states and 49868 transitions. [2025-03-03 15:16:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:16:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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 140 [2025-03-03 15:16:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:15,444 INFO L225 Difference]: With dead ends: 34164 [2025-03-03 15:16:15,444 INFO L226 Difference]: Without dead ends: 26002 [2025-03-03 15:16:15,454 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-03 15:16:15,454 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1236 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:15,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 415 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26002 states. [2025-03-03 15:16:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26002 to 17648. [2025-03-03 15:16:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17648 states, 17647 states have (on average 1.4447214824049412) internal successors, (25495), 17647 states have internal predecessors, (25495), 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-03 15:16:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17648 states to 17648 states and 25495 transitions. [2025-03-03 15:16:15,636 INFO L78 Accepts]: Start accepts. Automaton has 17648 states and 25495 transitions. Word has length 140 [2025-03-03 15:16:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:15,636 INFO L471 AbstractCegarLoop]: Abstraction has 17648 states and 25495 transitions. [2025-03-03 15:16:15,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 17648 states and 25495 transitions. [2025-03-03 15:16:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 15:16:15,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:15,637 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:16:15,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:16:15,637 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:15,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2140594717, now seen corresponding path program 1 times [2025-03-03 15:16:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:15,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295305640] [2025-03-03 15:16:15,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:15,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:16:15,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:16:15,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:15,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:15,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295305640] [2025-03-03 15:16:15,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295305640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:15,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:15,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:16:15,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880708157] [2025-03-03 15:16:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:15,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:16:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:15,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:16:15,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:15,733 INFO L87 Difference]: Start difference. First operand 17648 states and 25495 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:16,026 INFO L93 Difference]: Finished difference Result 66996 states and 97461 transitions. [2025-03-03 15:16:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:16:16,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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 140 [2025-03-03 15:16:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:16,079 INFO L225 Difference]: With dead ends: 66996 [2025-03-03 15:16:16,079 INFO L226 Difference]: Without dead ends: 49514 [2025-03-03 15:16:16,101 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-03 15:16:16,101 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1151 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:16,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 413 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:16:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49514 states. [2025-03-03 15:16:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49514 to 37448. [2025-03-03 15:16:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37448 states, 37447 states have (on average 1.4434534141586777) internal successors, (54053), 37447 states have internal predecessors, (54053), 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-03 15:16:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37448 states to 37448 states and 54053 transitions. [2025-03-03 15:16:16,492 INFO L78 Accepts]: Start accepts. Automaton has 37448 states and 54053 transitions. Word has length 140 [2025-03-03 15:16:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:16,492 INFO L471 AbstractCegarLoop]: Abstraction has 37448 states and 54053 transitions. [2025-03-03 15:16:16,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 37448 states and 54053 transitions. [2025-03-03 15:16:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 15:16:16,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:16,494 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:16:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:16:16,494 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:16,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1486157565, now seen corresponding path program 1 times [2025-03-03 15:16:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:16,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818068311] [2025-03-03 15:16:16,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:16,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:16:16,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:16:16,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:16,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:16,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818068311] [2025-03-03 15:16:16,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818068311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:16,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:16,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:16:16,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240863901] [2025-03-03 15:16:16,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:16,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:16:16,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:16,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:16:16,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:16,572 INFO L87 Difference]: Start difference. First operand 37448 states and 54053 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:16,896 INFO L93 Difference]: Finished difference Result 131500 states and 190559 transitions. [2025-03-03 15:16:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:16:16,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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 140 [2025-03-03 15:16:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:16,990 INFO L225 Difference]: With dead ends: 131500 [2025-03-03 15:16:16,990 INFO L226 Difference]: Without dead ends: 94218 [2025-03-03 15:16:17,029 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-03 15:16:17,029 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1066 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:17,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 411 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94218 states. [2025-03-03 15:16:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94218 to 79368. [2025-03-03 15:16:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79368 states, 79367 states have (on average 1.44161931281263) internal successors, (114417), 79367 states have internal predecessors, (114417), 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-03 15:16:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79368 states to 79368 states and 114417 transitions. [2025-03-03 15:16:18,074 INFO L78 Accepts]: Start accepts. Automaton has 79368 states and 114417 transitions. Word has length 140 [2025-03-03 15:16:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:18,074 INFO L471 AbstractCegarLoop]: Abstraction has 79368 states and 114417 transitions. [2025-03-03 15:16:18,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 79368 states and 114417 transitions. [2025-03-03 15:16:18,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 15:16:18,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:18,075 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:16:18,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:16:18,075 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:18,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1929107163, now seen corresponding path program 1 times [2025-03-03 15:16:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226808041] [2025-03-03 15:16:18,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:18,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:16:18,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:16:18,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:18,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226808041] [2025-03-03 15:16:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226808041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:18,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:16:18,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112107351] [2025-03-03 15:16:18,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:18,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:16:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:18,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:16:18,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:18,153 INFO L87 Difference]: Start difference. First operand 79368 states and 114417 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:18,872 INFO L93 Difference]: Finished difference Result 258188 states and 372579 transitions. [2025-03-03 15:16:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:16:18,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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 140 [2025-03-03 15:16:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:19,077 INFO L225 Difference]: With dead ends: 258188 [2025-03-03 15:16:19,078 INFO L226 Difference]: Without dead ends: 178986 [2025-03-03 15:16:19,151 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-03 15:16:19,151 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 981 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:19,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 409 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178986 states. [2025-03-03 15:16:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178986 to 167848. [2025-03-03 15:16:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167848 states, 167847 states have (on average 1.4396503958962628) internal successors, (241641), 167847 states have internal predecessors, (241641), 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-03 15:16:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167848 states to 167848 states and 241641 transitions. [2025-03-03 15:16:21,187 INFO L78 Accepts]: Start accepts. Automaton has 167848 states and 241641 transitions. Word has length 140 [2025-03-03 15:16:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:21,187 INFO L471 AbstractCegarLoop]: Abstraction has 167848 states and 241641 transitions. [2025-03-03 15:16:21,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 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-03 15:16:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 167848 states and 241641 transitions. [2025-03-03 15:16:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 15:16:21,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:21,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:21,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:16:21,211 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:21,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1768524769, now seen corresponding path program 1 times [2025-03-03 15:16:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858765024] [2025-03-03 15:16:21,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:21,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 15:16:21,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 15:16:21,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:21,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 15:16:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858765024] [2025-03-03 15:16:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858765024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859817222] [2025-03-03 15:16:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:21,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:21,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:21,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:21,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:21,335 INFO L87 Difference]: Start difference. First operand 167848 states and 241641 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03 15:16:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:22,524 INFO L93 Difference]: Finished difference Result 325740 states and 468187 transitions. [2025-03-03 15:16:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:22,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 171 [2025-03-03 15:16:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:22,693 INFO L225 Difference]: With dead ends: 325740 [2025-03-03 15:16:22,693 INFO L226 Difference]: Without dead ends: 158052 [2025-03-03 15:16:22,761 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-03 15:16:22,762 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 93 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 459 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-03 15:16:22,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 459 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158052 states. [2025-03-03 15:16:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158052 to 155158. [2025-03-03 15:16:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155158 states, 155157 states have (on average 1.428849487938024) internal successors, (221696), 155157 states have internal predecessors, (221696), 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-03 15:16:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155158 states to 155158 states and 221696 transitions. [2025-03-03 15:16:24,682 INFO L78 Accepts]: Start accepts. Automaton has 155158 states and 221696 transitions. Word has length 171 [2025-03-03 15:16:24,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:24,682 INFO L471 AbstractCegarLoop]: Abstraction has 155158 states and 221696 transitions. [2025-03-03 15:16:24,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03 15:16:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 155158 states and 221696 transitions. [2025-03-03 15:16:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:16:24,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:24,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:16:24,700 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:24,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1834942707, now seen corresponding path program 1 times [2025-03-03 15:16:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:24,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907237137] [2025-03-03 15:16:24,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:24,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:16:24,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:16:24,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:24,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 15:16:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907237137] [2025-03-03 15:16:24,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907237137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:24,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:24,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:24,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624596268] [2025-03-03 15:16:24,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:24,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:24,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:24,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:24,778 INFO L87 Difference]: Start difference. First operand 155158 states and 221696 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-03 15:16:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:25,416 INFO L93 Difference]: Finished difference Result 300426 states and 428386 transitions. [2025-03-03 15:16:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 172 [2025-03-03 15:16:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:25,876 INFO L225 Difference]: With dead ends: 300426 [2025-03-03 15:16:25,876 INFO L226 Difference]: Without dead ends: 145416 [2025-03-03 15:16:25,913 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-03 15:16:25,913 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 86 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 460 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-03 15:16:25,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 460 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145416 states. [2025-03-03 15:16:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145416 to 142630. [2025-03-03 15:16:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142630 states, 142629 states have (on average 1.4177200989981) internal successors, (202208), 142629 states have internal predecessors, (202208), 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-03 15:16:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142630 states to 142630 states and 202208 transitions. [2025-03-03 15:16:27,613 INFO L78 Accepts]: Start accepts. Automaton has 142630 states and 202208 transitions. Word has length 172 [2025-03-03 15:16:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:27,613 INFO L471 AbstractCegarLoop]: Abstraction has 142630 states and 202208 transitions. [2025-03-03 15:16:27,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-03 15:16:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 142630 states and 202208 transitions. [2025-03-03 15:16:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 15:16:27,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:27,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:27,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:16:27,627 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1180984050, now seen corresponding path program 1 times [2025-03-03 15:16:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:27,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989021331] [2025-03-03 15:16:27,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:27,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 15:16:27,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 15:16:27,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:27,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 15:16:27,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:27,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989021331] [2025-03-03 15:16:27,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989021331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:27,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:27,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:27,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39249304] [2025-03-03 15:16:27,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:27,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:27,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:27,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:27,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:27,716 INFO L87 Difference]: Start difference. First operand 142630 states and 202208 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-03 15:16:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:28,556 INFO L93 Difference]: Finished difference Result 275370 states and 389410 transitions. [2025-03-03 15:16:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:28,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 173 [2025-03-03 15:16:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:28,701 INFO L225 Difference]: With dead ends: 275370 [2025-03-03 15:16:28,701 INFO L226 Difference]: Without dead ends: 132888 [2025-03-03 15:16:28,748 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-03 15:16:28,748 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 79 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 461 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-03 15:16:28,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 461 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132888 states. [2025-03-03 15:16:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132888 to 130102. [2025-03-03 15:16:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130102 states, 130101 states have (on average 1.4044473140098845) internal successors, (182720), 130101 states have internal predecessors, (182720), 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-03 15:16:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130102 states to 130102 states and 182720 transitions. [2025-03-03 15:16:30,306 INFO L78 Accepts]: Start accepts. Automaton has 130102 states and 182720 transitions. Word has length 173 [2025-03-03 15:16:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:30,306 INFO L471 AbstractCegarLoop]: Abstraction has 130102 states and 182720 transitions. [2025-03-03 15:16:30,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-03 15:16:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 130102 states and 182720 transitions. [2025-03-03 15:16:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 15:16:30,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:30,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:30,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:16:30,318 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:30,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1089255078, now seen corresponding path program 1 times [2025-03-03 15:16:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198013702] [2025-03-03 15:16:30,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:30,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 15:16:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 15:16:30,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 15:16:30,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:30,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198013702] [2025-03-03 15:16:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198013702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517210828] [2025-03-03 15:16:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:30,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:30,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:30,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:30,441 INFO L87 Difference]: Start difference. First operand 130102 states and 182720 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-03 15:16:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:30,989 INFO L93 Difference]: Finished difference Result 250314 states and 350434 transitions. [2025-03-03 15:16:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 174 [2025-03-03 15:16:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:31,123 INFO L225 Difference]: With dead ends: 250314 [2025-03-03 15:16:31,123 INFO L226 Difference]: Without dead ends: 120360 [2025-03-03 15:16:31,210 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-03 15:16:31,210 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 72 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 462 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-03 15:16:31,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 462 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120360 states. [2025-03-03 15:16:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120360 to 117574. [2025-03-03 15:16:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117574 states, 117573 states have (on average 1.3883459637842022) internal successors, (163232), 117573 states have internal predecessors, (163232), 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-03 15:16:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117574 states to 117574 states and 163232 transitions. [2025-03-03 15:16:32,717 INFO L78 Accepts]: Start accepts. Automaton has 117574 states and 163232 transitions. Word has length 174 [2025-03-03 15:16:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:32,717 INFO L471 AbstractCegarLoop]: Abstraction has 117574 states and 163232 transitions. [2025-03-03 15:16:32,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-03 15:16:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 117574 states and 163232 transitions. [2025-03-03 15:16:32,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 15:16:32,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:32,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:32,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:16:32,724 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:32,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1656606523, now seen corresponding path program 1 times [2025-03-03 15:16:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660537516] [2025-03-03 15:16:32,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:32,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 15:16:32,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 15:16:32,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:32,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:16:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660537516] [2025-03-03 15:16:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660537516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:32,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416046520] [2025-03-03 15:16:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:32,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:32,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:32,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:32,802 INFO L87 Difference]: Start difference. First operand 117574 states and 163232 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-03 15:16:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:33,633 INFO L93 Difference]: Finished difference Result 342218 states and 472674 transitions. [2025-03-03 15:16:33,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:33,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 175 [2025-03-03 15:16:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:33,861 INFO L225 Difference]: With dead ends: 342218 [2025-03-03 15:16:33,861 INFO L226 Difference]: Without dead ends: 224792 [2025-03-03 15:16:33,916 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-03 15:16:33,917 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 65 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 463 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-03 15:16:33,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 463 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224792 states. [2025-03-03 15:16:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224792 to 211798. [2025-03-03 15:16:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211798 states, 211797 states have (on average 1.3741459982908162) internal successors, (291040), 211797 states have internal predecessors, (291040), 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-03 15:16:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211798 states to 211798 states and 291040 transitions. [2025-03-03 15:16:36,476 INFO L78 Accepts]: Start accepts. Automaton has 211798 states and 291040 transitions. Word has length 175 [2025-03-03 15:16:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:36,476 INFO L471 AbstractCegarLoop]: Abstraction has 211798 states and 291040 transitions. [2025-03-03 15:16:36,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-03 15:16:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 211798 states and 291040 transitions. [2025-03-03 15:16:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:16:36,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:36,485 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:36,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:16:36,485 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:36,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash -439268826, now seen corresponding path program 1 times [2025-03-03 15:16:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873821687] [2025-03-03 15:16:36,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:36,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:16:36,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:16:36,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:36,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:37,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:37,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873821687] [2025-03-03 15:16:37,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873821687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:16:37,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673167835] [2025-03-03 15:16:37,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:37,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:16:37,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:16:37,215 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-03 15:16:37,216 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-03 15:16:37,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:16:37,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:16:37,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:37,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:37,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 15:16:37,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:16:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:16:37,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:16:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:16:38,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673167835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:16:38,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:16:38,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 20 [2025-03-03 15:16:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148683052] [2025-03-03 15:16:38,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:16:38,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 15:16:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:38,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 15:16:38,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:16:38,725 INFO L87 Difference]: Start difference. First operand 211798 states and 291040 transitions. Second operand has 20 states, 20 states have (on average 25.0) internal successors, (500), 20 states have internal predecessors, (500), 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-03 15:16:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:48,583 INFO L93 Difference]: Finished difference Result 2099680 states and 2895455 transitions. [2025-03-03 15:16:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-03 15:16:48,583 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 25.0) internal successors, (500), 20 states have internal predecessors, (500), 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 176 [2025-03-03 15:16:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:51,371 INFO L225 Difference]: With dead ends: 2099680 [2025-03-03 15:16:51,371 INFO L226 Difference]: Without dead ends: 1888030 [2025-03-03 15:16:51,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7395 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2999, Invalid=15091, Unknown=0, NotChecked=0, Total=18090 [2025-03-03 15:16:51,594 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 13643 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13643 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:51,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13643 Valid, 2704 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 15:16:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888030 states.