./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e7bf678f67bc088f549a4abb07f450d970cef489f8318e3fb7c3771679b9e87b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:41:19,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:41:19,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:41:19,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:41:19,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:41:19,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:41:19,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:41:19,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:41:19,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:41:19,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:41:19,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:41:19,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:41:19,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:41:19,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:41:19,310 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:41:19,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:41:19,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:41:19,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:41:19,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:41:19,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:41:19,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:41:19,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:41:19,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:41:19,313 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-jdk21/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 -> e7bf678f67bc088f549a4abb07f450d970cef489f8318e3fb7c3771679b9e87b [2025-02-05 16:41:19,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:41:19,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:41:19,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:41:19,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:41:19,641 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:41:19,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:41:21,073 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81561e37d/b2e3618eafd043e381def51a7cebee6f/FLAG1cdb9a0cd [2025-02-05 16:41:21,410 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:41:21,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:41:21,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81561e37d/b2e3618eafd043e381def51a7cebee6f/FLAG1cdb9a0cd [2025-02-05 16:41:21,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81561e37d/b2e3618eafd043e381def51a7cebee6f [2025-02-05 16:41:21,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:41:21,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:41:21,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:41:21,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:41:21,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:41:21,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:21,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7688bc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21, skipping insertion in model container [2025-02-05 16:41:21,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:21,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:41:21,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7981,7994] [2025-02-05 16:41:21,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:41:21,784 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:41:21,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7981,7994] [2025-02-05 16:41:21,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:41:21,897 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:41:21,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21 WrapperNode [2025-02-05 16:41:21,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:41:21,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:41:21,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:41:21,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:41:21,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:21,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:21,957 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 688 [2025-02-05 16:41:21,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:41:21,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:41:21,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:41:21,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:41:21,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:21,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:21,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:21,994 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-02-05 16:41:21,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:21,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:22,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:22,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:22,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:22,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:22,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:41:22,016 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:41:22,016 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:41:22,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:41:22,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (1/1) ... [2025-02-05 16:41:22,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:41:22,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:22,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:41:22,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:41:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:41:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:41:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:41:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:41:22,192 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:41:22,194 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:41:22,753 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:22,754 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:22,754 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:22,754 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L477: havoc main_~node4__m4~2#1; [2025-02-05 16:41:22,754 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: havoc main_~node3__m3~2#1; [2025-02-05 16:41:22,754 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:41:22,754 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~2#1; [2025-02-05 16:41:22,754 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: havoc main_~node2__m2~2#1; [2025-02-05 16:41:22,755 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: 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_~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_~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-02-05 16:41:22,789 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-05 16:41:22,789 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:41:22,805 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:41:22,805 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:41:22,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:41:22 BoogieIcfgContainer [2025-02-05 16:41:22,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:41:22,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:41:22,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:41:22,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:41:22,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:41:21" (1/3) ... [2025-02-05 16:41:22,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636d82a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:41:22, skipping insertion in model container [2025-02-05 16:41:22,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:41:21" (2/3) ... [2025-02-05 16:41:22,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636d82a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:41:22, skipping insertion in model container [2025-02-05 16:41:22,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:41:22" (3/3) ... [2025-02-05 16:41:22,828 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:41:22,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:41:22,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 150 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:41:22,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:41:22,920 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;@5461b17a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:41:22,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:41:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:41:22,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:22,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:22,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:22,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2097982300, now seen corresponding path program 1 times [2025-02-05 16:41:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781496937] [2025-02-05 16:41:22,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:23,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:41:23,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:41:23,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:23,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781496937] [2025-02-05 16:41:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781496937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:23,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:23,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:41:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096034468] [2025-02-05 16:41:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:23,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:23,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:23,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:23,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:23,720 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 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 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:24,147 INFO L93 Difference]: Finished difference Result 845 states and 1355 transitions. [2025-02-05 16:41:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:41:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 16:41:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:24,167 INFO L225 Difference]: With dead ends: 845 [2025-02-05 16:41:24,167 INFO L226 Difference]: Without dead ends: 751 [2025-02-05 16:41:24,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:41:24,173 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 1364 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:24,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 2999 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-02-05 16:41:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 227. [2025-02-05 16:41:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-02-05 16:41:24,221 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 76 [2025-02-05 16:41:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:24,222 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-02-05 16:41:24,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-02-05 16:41:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:41:24,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:24,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:24,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:41:24,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -67695176, now seen corresponding path program 1 times [2025-02-05 16:41:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:24,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418045235] [2025-02-05 16:41:24,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:24,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:41:24,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:41:24,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:24,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:24,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:24,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418045235] [2025-02-05 16:41:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418045235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:41:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81122247] [2025-02-05 16:41:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:24,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:24,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:24,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:24,594 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:24,821 INFO L93 Difference]: Finished difference Result 922 states and 1419 transitions. [2025-02-05 16:41:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:41:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:41:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:24,826 INFO L225 Difference]: With dead ends: 922 [2025-02-05 16:41:24,827 INFO L226 Difference]: Without dead ends: 802 [2025-02-05 16:41:24,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:41:24,829 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 943 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:24,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1872 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-05 16:41:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 361. [2025-02-05 16:41:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.5) internal successors, (540), 360 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 540 transitions. [2025-02-05 16:41:24,865 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 540 transitions. Word has length 78 [2025-02-05 16:41:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:24,866 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 540 transitions. [2025-02-05 16:41:24,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 540 transitions. [2025-02-05 16:41:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:41:24,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:24,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:24,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:41:24,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:24,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash -744597312, now seen corresponding path program 1 times [2025-02-05 16:41:24,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:24,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588316712] [2025-02-05 16:41:24,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:24,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:24,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:41:24,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:41:24,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:24,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:25,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:25,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588316712] [2025-02-05 16:41:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588316712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:25,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:25,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:41:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900194444] [2025-02-05 16:41:25,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:25,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:25,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:25,153 INFO L87 Difference]: Start difference. First operand 361 states and 540 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:25,373 INFO L93 Difference]: Finished difference Result 1056 states and 1631 transitions. [2025-02-05 16:41:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:41:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:41:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:25,380 INFO L225 Difference]: With dead ends: 1056 [2025-02-05 16:41:25,380 INFO L226 Difference]: Without dead ends: 936 [2025-02-05 16:41:25,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:41:25,383 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 936 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:25,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1481 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-02-05 16:41:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 554. [2025-02-05 16:41:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.5280289330922243) internal successors, (845), 553 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 845 transitions. [2025-02-05 16:41:25,407 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 845 transitions. Word has length 78 [2025-02-05 16:41:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:25,408 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 845 transitions. [2025-02-05 16:41:25,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 845 transitions. [2025-02-05 16:41:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:41:25,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:25,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] [2025-02-05 16:41:25,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:41:25,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:25,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1658299456, now seen corresponding path program 1 times [2025-02-05 16:41:25,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:25,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386515101] [2025-02-05 16:41:25,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:25,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:25,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:41:25,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:41:25,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:25,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386515101] [2025-02-05 16:41:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386515101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:25,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:41:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274605867] [2025-02-05 16:41:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:25,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:25,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:25,670 INFO L87 Difference]: Start difference. First operand 554 states and 845 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:25,859 INFO L93 Difference]: Finished difference Result 1185 states and 1835 transitions. [2025-02-05 16:41:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:41:25,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:41:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:25,866 INFO L225 Difference]: With dead ends: 1185 [2025-02-05 16:41:25,866 INFO L226 Difference]: Without dead ends: 1065 [2025-02-05 16:41:25,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:41:25,868 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1106 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:25,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1355 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-02-05 16:41:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 678. [2025-02-05 16:41:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.5376661742983753) internal successors, (1041), 677 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1041 transitions. [2025-02-05 16:41:25,898 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1041 transitions. Word has length 78 [2025-02-05 16:41:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:25,898 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1041 transitions. [2025-02-05 16:41:25,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1041 transitions. [2025-02-05 16:41:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:41:25,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:25,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:25,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:41:25,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:25,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash 586614712, now seen corresponding path program 1 times [2025-02-05 16:41:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:25,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042257775] [2025-02-05 16:41:25,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:25,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:41:25,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:41:25,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:25,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:26,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042257775] [2025-02-05 16:41:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042257775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:41:26,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012795882] [2025-02-05 16:41:26,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:26,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:26,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:26,136 INFO L87 Difference]: Start difference. First operand 678 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,309 INFO L93 Difference]: Finished difference Result 1304 states and 2023 transitions. [2025-02-05 16:41:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:41:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:41:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,315 INFO L225 Difference]: With dead ends: 1304 [2025-02-05 16:41:26,316 INFO L226 Difference]: Without dead ends: 1184 [2025-02-05 16:41:26,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:41:26,317 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 1199 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:26,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 1248 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-02-05 16:41:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 797. [2025-02-05 16:41:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.5439698492462313) internal successors, (1229), 796 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1229 transitions. [2025-02-05 16:41:26,342 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1229 transitions. Word has length 78 [2025-02-05 16:41:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,342 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1229 transitions. [2025-02-05 16:41:26,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1229 transitions. [2025-02-05 16:41:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:41:26,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:41:26,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:26,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1860336837, now seen corresponding path program 1 times [2025-02-05 16:41:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711636187] [2025-02-05 16:41:26,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:41:26,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:41:26,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711636187] [2025-02-05 16:41:26,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711636187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:26,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564428407] [2025-02-05 16:41:26,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:26,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:26,419 INFO L87 Difference]: Start difference. First operand 797 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,450 INFO L93 Difference]: Finished difference Result 2028 states and 3164 transitions. [2025-02-05 16:41:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:26,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:41:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,456 INFO L225 Difference]: With dead ends: 2028 [2025-02-05 16:41:26,456 INFO L226 Difference]: Without dead ends: 1377 [2025-02-05 16:41:26,457 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-02-05 16:41:26,458 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 83 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 470 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-02-05 16:41:26,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-02-05 16:41:26,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1375. [2025-02-05 16:41:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 1.5363901018922852) internal successors, (2111), 1374 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2111 transitions. [2025-02-05 16:41:26,504 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2111 transitions. Word has length 78 [2025-02-05 16:41:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,504 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2111 transitions. [2025-02-05 16:41:26,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2111 transitions. [2025-02-05 16:41:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:41:26,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:26,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:41:26,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:26,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1861498686, now seen corresponding path program 1 times [2025-02-05 16:41:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482486610] [2025-02-05 16:41:26,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:41:26,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:41:26,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:26,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482486610] [2025-02-05 16:41:26,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482486610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:41:26,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727133665] [2025-02-05 16:41:26,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:26,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:26,857 INFO L87 Difference]: Start difference. First operand 1375 states and 2111 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:27,073 INFO L93 Difference]: Finished difference Result 2606 states and 4024 transitions. [2025-02-05 16:41:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:41:27,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:41:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:27,079 INFO L225 Difference]: With dead ends: 2606 [2025-02-05 16:41:27,080 INFO L226 Difference]: Without dead ends: 1377 [2025-02-05 16:41:27,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:41:27,085 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 369 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:27,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 765 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-02-05 16:41:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1375. [2025-02-05 16:41:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 1.532023289665211) internal successors, (2105), 1374 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2105 transitions. [2025-02-05 16:41:27,124 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2105 transitions. Word has length 78 [2025-02-05 16:41:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:27,124 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2105 transitions. [2025-02-05 16:41:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2105 transitions. [2025-02-05 16:41:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:41:27,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:27,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:27,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:41:27,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:27,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1334454968, now seen corresponding path program 1 times [2025-02-05 16:41:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:27,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491724872] [2025-02-05 16:41:27,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:27,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:41:27,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:41:27,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:27,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:27,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:27,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491724872] [2025-02-05 16:41:27,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491724872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:27,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:27,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:41:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080298992] [2025-02-05 16:41:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:27,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:27,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:27,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:27,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:27,318 INFO L87 Difference]: Start difference. First operand 1375 states and 2105 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:27,495 INFO L93 Difference]: Finished difference Result 2531 states and 3895 transitions. [2025-02-05 16:41:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:41:27,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:41:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:27,504 INFO L225 Difference]: With dead ends: 2531 [2025-02-05 16:41:27,504 INFO L226 Difference]: Without dead ends: 2306 [2025-02-05 16:41:27,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:41:27,506 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 1082 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:27,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1587 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-02-05 16:41:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1609. [2025-02-05 16:41:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2468 transitions. [2025-02-05 16:41:27,550 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2468 transitions. Word has length 78 [2025-02-05 16:41:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:27,551 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2468 transitions. [2025-02-05 16:41:27,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2468 transitions. [2025-02-05 16:41:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:41:27,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:27,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:27,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:41:27,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:27,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1840639618, now seen corresponding path program 1 times [2025-02-05 16:41:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523850001] [2025-02-05 16:41:27,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:27,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:41:27,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:41:27,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:27,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523850001] [2025-02-05 16:41:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523850001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:27,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:27,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815999960] [2025-02-05 16:41:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:27,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:27,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:27,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:27,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:27,672 INFO L87 Difference]: Start difference. First operand 1609 states and 2468 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:27,894 INFO L93 Difference]: Finished difference Result 4698 states and 7251 transitions. [2025-02-05 16:41:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 16:41:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:27,907 INFO L225 Difference]: With dead ends: 4698 [2025-02-05 16:41:27,907 INFO L226 Difference]: Without dead ends: 3127 [2025-02-05 16:41:27,910 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-02-05 16:41:27,910 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 810 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:27,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 178 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2025-02-05 16:41:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3125. [2025-02-05 16:41:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.5345710627400768) internal successors, (4794), 3124 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4794 transitions. [2025-02-05 16:41:27,996 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4794 transitions. Word has length 79 [2025-02-05 16:41:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:27,996 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4794 transitions. [2025-02-05 16:41:27,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4794 transitions. [2025-02-05 16:41:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:41:27,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:27,998 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] [2025-02-05 16:41:27,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:41:27,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:27,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 799942618, now seen corresponding path program 1 times [2025-02-05 16:41:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:28,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425793162] [2025-02-05 16:41:28,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:28,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:41:28,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:41:28,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:28,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:28,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:28,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425793162] [2025-02-05 16:41:28,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425793162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:28,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:28,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220708087] [2025-02-05 16:41:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:28,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:28,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:28,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:28,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:28,134 INFO L87 Difference]: Start difference. First operand 3125 states and 4794 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:28,294 INFO L93 Difference]: Finished difference Result 6200 states and 9535 transitions. [2025-02-05 16:41:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:28,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 16:41:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:28,306 INFO L225 Difference]: With dead ends: 6200 [2025-02-05 16:41:28,306 INFO L226 Difference]: Without dead ends: 3125 [2025-02-05 16:41:28,310 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-02-05 16:41:28,311 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 517 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:28,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 134 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-02-05 16:41:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-02-05 16:41:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.517605633802817) internal successors, (4741), 3124 states have internal predecessors, (4741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4741 transitions. [2025-02-05 16:41:28,382 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4741 transitions. Word has length 80 [2025-02-05 16:41:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:28,382 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4741 transitions. [2025-02-05 16:41:28,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4741 transitions. [2025-02-05 16:41:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:41:28,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:28,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:28,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:41:28,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:28,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash -648103130, now seen corresponding path program 1 times [2025-02-05 16:41:28,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:28,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356482285] [2025-02-05 16:41:28,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:28,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:28,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:41:28,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:41:28,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:28,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:28,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356482285] [2025-02-05 16:41:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356482285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:28,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:28,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:28,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289534548] [2025-02-05 16:41:28,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:28,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:28,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:28,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:28,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:28,507 INFO L87 Difference]: Start difference. First operand 3125 states and 4741 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:28,650 INFO L93 Difference]: Finished difference Result 6196 states and 9425 transitions. [2025-02-05 16:41:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:28,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:41:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:28,662 INFO L225 Difference]: With dead ends: 6196 [2025-02-05 16:41:28,663 INFO L226 Difference]: Without dead ends: 3125 [2025-02-05 16:41:28,667 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-02-05 16:41:28,668 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 499 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:28,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 142 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-02-05 16:41:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-02-05 16:41:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.500640204865557) internal successors, (4688), 3124 states have internal predecessors, (4688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4688 transitions. [2025-02-05 16:41:28,731 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4688 transitions. Word has length 81 [2025-02-05 16:41:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:28,731 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4688 transitions. [2025-02-05 16:41:28,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4688 transitions. [2025-02-05 16:41:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:41:28,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:28,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:28,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:41:28,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:28,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1645540534, now seen corresponding path program 1 times [2025-02-05 16:41:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:28,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103905023] [2025-02-05 16:41:28,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:28,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:41:28,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:41:28,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:28,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:28,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:28,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103905023] [2025-02-05 16:41:28,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103905023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:28,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:28,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817171762] [2025-02-05 16:41:28,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:28,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:28,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:28,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:28,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:28,841 INFO L87 Difference]: Start difference. First operand 3125 states and 4688 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:28,978 INFO L93 Difference]: Finished difference Result 6208 states and 9333 transitions. [2025-02-05 16:41:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:28,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:41:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:28,989 INFO L225 Difference]: With dead ends: 6208 [2025-02-05 16:41:28,990 INFO L226 Difference]: Without dead ends: 3125 [2025-02-05 16:41:28,994 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-02-05 16:41:28,994 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 527 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:28,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 118 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-02-05 16:41:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-02-05 16:41:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.483674775928297) internal successors, (4635), 3124 states have internal predecessors, (4635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4635 transitions. [2025-02-05 16:41:29,078 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4635 transitions. Word has length 82 [2025-02-05 16:41:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:29,079 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4635 transitions. [2025-02-05 16:41:29,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4635 transitions. [2025-02-05 16:41:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:41:29,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:29,080 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] [2025-02-05 16:41:29,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:41:29,080 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:29,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash 354764674, now seen corresponding path program 1 times [2025-02-05 16:41:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023359216] [2025-02-05 16:41:29,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:29,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:41:29,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:41:29,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:29,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:29,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:29,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023359216] [2025-02-05 16:41:29,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023359216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:29,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801862214] [2025-02-05 16:41:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:29,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:29,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:29,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:29,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:29,184 INFO L87 Difference]: Start difference. First operand 3125 states and 4635 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:29,325 INFO L93 Difference]: Finished difference Result 6204 states and 9223 transitions. [2025-02-05 16:41:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:41:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:29,338 INFO L225 Difference]: With dead ends: 6204 [2025-02-05 16:41:29,338 INFO L226 Difference]: Without dead ends: 3125 [2025-02-05 16:41:29,342 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-02-05 16:41:29,343 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 509 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:29,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 126 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-02-05 16:41:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-02-05 16:41:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.466709346991037) internal successors, (4582), 3124 states have internal predecessors, (4582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4582 transitions. [2025-02-05 16:41:29,402 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4582 transitions. Word has length 83 [2025-02-05 16:41:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:29,402 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4582 transitions. [2025-02-05 16:41:29,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4582 transitions. [2025-02-05 16:41:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:41:29,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:29,404 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] [2025-02-05 16:41:29,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:41:29,404 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:29,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -336030318, now seen corresponding path program 1 times [2025-02-05 16:41:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174500386] [2025-02-05 16:41:29,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:29,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:41:29,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:41:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:29,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174500386] [2025-02-05 16:41:29,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174500386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:29,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:29,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:41:29,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079774745] [2025-02-05 16:41:29,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:29,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:41:29,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:29,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:41:29,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:41:29,911 INFO L87 Difference]: Start difference. First operand 3125 states and 4582 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:30,610 INFO L93 Difference]: Finished difference Result 9175 states and 13438 transitions. [2025-02-05 16:41:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:41:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 16:41:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:30,633 INFO L225 Difference]: With dead ends: 9175 [2025-02-05 16:41:30,633 INFO L226 Difference]: Without dead ends: 6217 [2025-02-05 16:41:30,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:41:30,640 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 608 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:30,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 565 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6217 states. [2025-02-05 16:41:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6217 to 3125. [2025-02-05 16:41:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.4638284250960307) internal successors, (4573), 3124 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4573 transitions. [2025-02-05 16:41:30,746 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4573 transitions. Word has length 84 [2025-02-05 16:41:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:30,746 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4573 transitions. [2025-02-05 16:41:30,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4573 transitions. [2025-02-05 16:41:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:41:30,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:30,748 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] [2025-02-05 16:41:30,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:41:30,748 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:30,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1427493388, now seen corresponding path program 1 times [2025-02-05 16:41:30,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:30,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975771077] [2025-02-05 16:41:30,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:30,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:41:30,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:41:30,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:30,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:31,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975771077] [2025-02-05 16:41:31,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975771077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:31,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:31,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:41:31,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106348813] [2025-02-05 16:41:31,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:31,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:41:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:31,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:41:31,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:41:31,155 INFO L87 Difference]: Start difference. First operand 3125 states and 4573 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:31,668 INFO L93 Difference]: Finished difference Result 7750 states and 11315 transitions. [2025-02-05 16:41:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:41:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-02-05 16:41:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:31,678 INFO L225 Difference]: With dead ends: 7750 [2025-02-05 16:41:31,678 INFO L226 Difference]: Without dead ends: 4747 [2025-02-05 16:41:31,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:41:31,683 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1155 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:31,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 502 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2025-02-05 16:41:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 3125. [2025-02-05 16:41:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.4628681177976952) internal successors, (4570), 3124 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4570 transitions. [2025-02-05 16:41:31,748 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4570 transitions. Word has length 85 [2025-02-05 16:41:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:31,748 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4570 transitions. [2025-02-05 16:41:31,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4570 transitions. [2025-02-05 16:41:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:41:31,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:31,750 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] [2025-02-05 16:41:31,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:41:31,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:31,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -535397612, now seen corresponding path program 1 times [2025-02-05 16:41:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:31,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26267484] [2025-02-05 16:41:31,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:31,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:31,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:41:31,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:41:31,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:31,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:32,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26267484] [2025-02-05 16:41:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26267484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:41:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169378417] [2025-02-05 16:41:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:32,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:41:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:32,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:41:32,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:41:32,207 INFO L87 Difference]: Start difference. First operand 3125 states and 4570 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:32,859 INFO L93 Difference]: Finished difference Result 9100 states and 13306 transitions. [2025-02-05 16:41:32,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:41:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-02-05 16:41:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:32,872 INFO L225 Difference]: With dead ends: 9100 [2025-02-05 16:41:32,872 INFO L226 Difference]: Without dead ends: 6187 [2025-02-05 16:41:32,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:41:32,878 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 837 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:32,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 703 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6187 states. [2025-02-05 16:41:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6187 to 3125. [2025-02-05 16:41:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.459346991037132) internal successors, (4559), 3124 states have internal predecessors, (4559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4559 transitions. [2025-02-05 16:41:32,950 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4559 transitions. Word has length 85 [2025-02-05 16:41:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:32,950 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4559 transitions. [2025-02-05 16:41:32,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4559 transitions. [2025-02-05 16:41:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:41:32,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:32,952 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] [2025-02-05 16:41:32,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:41:32,952 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:32,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1943153049, now seen corresponding path program 1 times [2025-02-05 16:41:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166073104] [2025-02-05 16:41:32,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:32,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:41:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:41:32,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:33,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:33,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166073104] [2025-02-05 16:41:33,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166073104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:33,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:33,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577886192] [2025-02-05 16:41:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:33,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:33,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:33,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:33,262 INFO L87 Difference]: Start difference. First operand 3125 states and 4559 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:33,643 INFO L93 Difference]: Finished difference Result 9006 states and 13200 transitions. [2025-02-05 16:41:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:41:33,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-02-05 16:41:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:33,656 INFO L225 Difference]: With dead ends: 9006 [2025-02-05 16:41:33,656 INFO L226 Difference]: Without dead ends: 6038 [2025-02-05 16:41:33,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:41:33,662 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 946 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:33,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 486 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2025-02-05 16:41:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3125. [2025-02-05 16:41:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.4590268886043534) internal successors, (4558), 3124 states have internal predecessors, (4558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4558 transitions. [2025-02-05 16:41:33,747 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4558 transitions. Word has length 86 [2025-02-05 16:41:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:33,747 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4558 transitions. [2025-02-05 16:41:33,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4558 transitions. [2025-02-05 16:41:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:41:33,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:33,749 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] [2025-02-05 16:41:33,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:41:33,749 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:33,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash -497212460, now seen corresponding path program 1 times [2025-02-05 16:41:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:33,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558612289] [2025-02-05 16:41:33,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:33,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:41:33,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:41:33,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:33,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:34,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:34,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558612289] [2025-02-05 16:41:34,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558612289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:34,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:34,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:41:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510395025] [2025-02-05 16:41:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:34,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:41:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:34,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:41:34,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:41:34,043 INFO L87 Difference]: Start difference. First operand 3125 states and 4558 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:34,642 INFO L93 Difference]: Finished difference Result 9220 states and 13456 transitions. [2025-02-05 16:41:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:41:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-02-05 16:41:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:34,653 INFO L225 Difference]: With dead ends: 9220 [2025-02-05 16:41:34,654 INFO L226 Difference]: Without dead ends: 6232 [2025-02-05 16:41:34,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:41:34,658 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 576 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:34,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 801 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2025-02-05 16:41:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 3125. [2025-02-05 16:41:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.4571062740076826) internal successors, (4552), 3124 states have internal predecessors, (4552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4552 transitions. [2025-02-05 16:41:34,715 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4552 transitions. Word has length 87 [2025-02-05 16:41:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:34,715 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4552 transitions. [2025-02-05 16:41:34,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4552 transitions. [2025-02-05 16:41:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:41:34,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:34,717 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] [2025-02-05 16:41:34,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:41:34,717 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:34,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash 312577193, now seen corresponding path program 1 times [2025-02-05 16:41:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:34,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426305793] [2025-02-05 16:41:34,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:34,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:41:34,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:41:34,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:34,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:37,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:37,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426305793] [2025-02-05 16:41:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426305793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-02-05 16:41:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298062868] [2025-02-05 16:41:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 16:41:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:37,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 16:41:37,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:41:37,281 INFO L87 Difference]: Start difference. First operand 3125 states and 4552 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:42,705 INFO L93 Difference]: Finished difference Result 8416 states and 12303 transitions. [2025-02-05 16:41:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 16:41:42,706 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-02-05 16:41:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:42,719 INFO L225 Difference]: With dead ends: 8416 [2025-02-05 16:41:42,720 INFO L226 Difference]: Without dead ends: 7967 [2025-02-05 16:41:42,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=569, Invalid=3337, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 16:41:42,723 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1680 mSDsluCounter, 9734 mSDsCounter, 0 mSdLazyCounter, 6603 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 10261 SdHoareTripleChecker+Invalid, 6623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:42,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 10261 Invalid, 6623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6603 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 16:41:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2025-02-05 16:41:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 3160. [2025-02-05 16:41:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3160 states, 3159 states have (on average 1.4558404558404558) internal successors, (4599), 3159 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4599 transitions. [2025-02-05 16:41:42,784 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4599 transitions. Word has length 88 [2025-02-05 16:41:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:42,785 INFO L471 AbstractCegarLoop]: Abstraction has 3160 states and 4599 transitions. [2025-02-05 16:41:42,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4599 transitions. [2025-02-05 16:41:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:41:42,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:42,786 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] [2025-02-05 16:41:42,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:41:42,787 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:42,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1131707089, now seen corresponding path program 1 times [2025-02-05 16:41:42,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519231686] [2025-02-05 16:41:42,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:42,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:41:42,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:41:42,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:42,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:43,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519231686] [2025-02-05 16:41:43,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519231686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:43,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:43,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:41:43,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099956684] [2025-02-05 16:41:43,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:43,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:41:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:43,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:41:43,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:41:43,400 INFO L87 Difference]: Start difference. First operand 3160 states and 4599 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:43,950 INFO L93 Difference]: Finished difference Result 7042 states and 10300 transitions. [2025-02-05 16:41:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:41:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-02-05 16:41:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:43,961 INFO L225 Difference]: With dead ends: 7042 [2025-02-05 16:41:43,961 INFO L226 Difference]: Without dead ends: 6089 [2025-02-05 16:41:43,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:41:43,965 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 990 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:43,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1236 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2025-02-05 16:41:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 3122. [2025-02-05 16:41:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3121 states have (on average 1.4546619673181673) internal successors, (4540), 3121 states have internal predecessors, (4540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4540 transitions. [2025-02-05 16:41:44,019 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4540 transitions. Word has length 88 [2025-02-05 16:41:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:44,019 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 4540 transitions. [2025-02-05 16:41:44,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4540 transitions. [2025-02-05 16:41:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:41:44,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:44,021 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] [2025-02-05 16:41:44,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:41:44,021 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:44,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash -682355463, now seen corresponding path program 1 times [2025-02-05 16:41:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265946639] [2025-02-05 16:41:44,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:44,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:41:44,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:41:44,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:44,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:44,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:44,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265946639] [2025-02-05 16:41:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265946639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:44,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:41:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084492432] [2025-02-05 16:41:44,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:44,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:41:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:44,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:41:44,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:41:44,710 INFO L87 Difference]: Start difference. First operand 3122 states and 4540 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:45,476 INFO L93 Difference]: Finished difference Result 7888 states and 11532 transitions. [2025-02-05 16:41:45,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:41:45,477 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-02-05 16:41:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:45,489 INFO L225 Difference]: With dead ends: 7888 [2025-02-05 16:41:45,489 INFO L226 Difference]: Without dead ends: 6930 [2025-02-05 16:41:45,492 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-02-05 16:41:45,493 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 993 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 3342 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:45,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 3342 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6930 states. [2025-02-05 16:41:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6930 to 3065. [2025-02-05 16:41:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 3064 states have (on average 1.456266318537859) internal successors, (4462), 3064 states have internal predecessors, (4462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4462 transitions. [2025-02-05 16:41:45,546 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4462 transitions. Word has length 88 [2025-02-05 16:41:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:45,547 INFO L471 AbstractCegarLoop]: Abstraction has 3065 states and 4462 transitions. [2025-02-05 16:41:45,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4462 transitions. [2025-02-05 16:41:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:41:45,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:45,548 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] [2025-02-05 16:41:45,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:41:45,548 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:45,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -536192223, now seen corresponding path program 1 times [2025-02-05 16:41:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003748957] [2025-02-05 16:41:45,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:45,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:41:45,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:41:45,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:45,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:46,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:46,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003748957] [2025-02-05 16:41:46,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003748957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:46,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:46,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 16:41:46,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360058537] [2025-02-05 16:41:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:46,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 16:41:46,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:46,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 16:41:46,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:41:46,387 INFO L87 Difference]: Start difference. First operand 3065 states and 4462 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:47,493 INFO L93 Difference]: Finished difference Result 4880 states and 7121 transitions. [2025-02-05 16:41:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:41:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-02-05 16:41:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:47,502 INFO L225 Difference]: With dead ends: 4880 [2025-02-05 16:41:47,502 INFO L226 Difference]: Without dead ends: 3964 [2025-02-05 16:41:47,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:41:47,507 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1052 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:47,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 2374 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-02-05 16:41:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3065. [2025-02-05 16:41:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 3064 states have (on average 1.455939947780679) internal successors, (4461), 3064 states have internal predecessors, (4461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4461 transitions. [2025-02-05 16:41:47,544 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4461 transitions. Word has length 88 [2025-02-05 16:41:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:47,544 INFO L471 AbstractCegarLoop]: Abstraction has 3065 states and 4461 transitions. [2025-02-05 16:41:47,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4461 transitions. [2025-02-05 16:41:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:41:47,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:47,546 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] [2025-02-05 16:41:47,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:41:47,547 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:47,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1363777766, now seen corresponding path program 1 times [2025-02-05 16:41:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:47,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351554326] [2025-02-05 16:41:47,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:47,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:41:47,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:41:47,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:47,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:48,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351554326] [2025-02-05 16:41:48,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351554326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:48,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:48,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:41:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687770510] [2025-02-05 16:41:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:48,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:41:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:48,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:41:48,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:41:48,081 INFO L87 Difference]: Start difference. First operand 3065 states and 4461 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:48,696 INFO L93 Difference]: Finished difference Result 6880 states and 10072 transitions. [2025-02-05 16:41:48,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:41:48,696 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 16:41:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:48,704 INFO L225 Difference]: With dead ends: 6880 [2025-02-05 16:41:48,704 INFO L226 Difference]: Without dead ends: 5982 [2025-02-05 16:41:48,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:41:48,707 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 798 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:48,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1329 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2025-02-05 16:41:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3048. [2025-02-05 16:41:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 3047 states have (on average 1.455201837873318) internal successors, (4434), 3047 states have internal predecessors, (4434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4434 transitions. [2025-02-05 16:41:48,761 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4434 transitions. Word has length 89 [2025-02-05 16:41:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:48,761 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4434 transitions. [2025-02-05 16:41:48,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4434 transitions. [2025-02-05 16:41:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:41:48,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:48,762 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] [2025-02-05 16:41:48,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:41:48,762 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:48,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1403158557, now seen corresponding path program 1 times [2025-02-05 16:41:48,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:48,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903971086] [2025-02-05 16:41:48,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:48,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:48,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:41:48,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:41:48,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:48,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903971086] [2025-02-05 16:41:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903971086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:41:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388919401] [2025-02-05 16:41:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:41:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:48,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:41:48,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:41:48,876 INFO L87 Difference]: Start difference. First operand 3048 states and 4434 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:48,905 INFO L93 Difference]: Finished difference Result 7237 states and 10602 transitions. [2025-02-05 16:41:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:41:48,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 16:41:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:48,911 INFO L225 Difference]: With dead ends: 7237 [2025-02-05 16:41:48,912 INFO L226 Difference]: Without dead ends: 4335 [2025-02-05 16:41:48,915 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-02-05 16:41:48,916 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 90 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 436 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-02-05 16:41:48,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 436 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2025-02-05 16:41:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4333. [2025-02-05 16:41:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 4332 states have (on average 1.4531394275161589) internal successors, (6295), 4332 states have internal predecessors, (6295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 6295 transitions. [2025-02-05 16:41:48,962 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 6295 transitions. Word has length 89 [2025-02-05 16:41:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:48,963 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 6295 transitions. [2025-02-05 16:41:48,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 6295 transitions. [2025-02-05 16:41:48,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:41:48,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:48,964 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] [2025-02-05 16:41:48,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:41:48,964 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1435362628, now seen corresponding path program 1 times [2025-02-05 16:41:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883041198] [2025-02-05 16:41:48,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:48,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:41:48,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:41:48,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:48,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:49,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883041198] [2025-02-05 16:41:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883041198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:49,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:49,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:41:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166831334] [2025-02-05 16:41:49,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:49,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:41:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:49,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:41:49,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:41:49,157 INFO L87 Difference]: Start difference. First operand 4333 states and 6295 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:49,190 INFO L93 Difference]: Finished difference Result 4359 states and 6332 transitions. [2025-02-05 16:41:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:41:49,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 16:41:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:49,196 INFO L225 Difference]: With dead ends: 4359 [2025-02-05 16:41:49,196 INFO L226 Difference]: Without dead ends: 4357 [2025-02-05 16:41:49,197 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-02-05 16:41:49,197 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 713 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-02-05 16:41:49,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 713 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2025-02-05 16:41:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4357. [2025-02-05 16:41:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4357 states, 4356 states have (on average 1.4444444444444444) internal successors, (6292), 4356 states have internal predecessors, (6292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 6292 transitions. [2025-02-05 16:41:49,262 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 6292 transitions. Word has length 89 [2025-02-05 16:41:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:49,262 INFO L471 AbstractCegarLoop]: Abstraction has 4357 states and 6292 transitions. [2025-02-05 16:41:49,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 6292 transitions. [2025-02-05 16:41:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:41:49,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:49,263 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] [2025-02-05 16:41:49,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:41:49,263 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:49,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash -332502542, now seen corresponding path program 1 times [2025-02-05 16:41:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650878608] [2025-02-05 16:41:49,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:49,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:41:49,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:41:49,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:49,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650878608] [2025-02-05 16:41:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650878608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:51,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:51,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2025-02-05 16:41:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622274070] [2025-02-05 16:41:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:51,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 16:41:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:51,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 16:41:51,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 16:41:51,135 INFO L87 Difference]: Start difference. First operand 4357 states and 6292 transitions. Second operand has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:55,016 INFO L93 Difference]: Finished difference Result 12294 states and 17814 transitions. [2025-02-05 16:41:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 16:41:55,016 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 16:41:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:55,030 INFO L225 Difference]: With dead ends: 12294 [2025-02-05 16:41:55,030 INFO L226 Difference]: Without dead ends: 11177 [2025-02-05 16:41:55,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=560, Invalid=3100, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 16:41:55,036 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 1502 mSDsluCounter, 6044 mSDsCounter, 0 mSdLazyCounter, 4294 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 6407 SdHoareTripleChecker+Invalid, 4307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:55,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 6407 Invalid, 4307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4294 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 16:41:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2025-02-05 16:41:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 4370. [2025-02-05 16:41:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4370 states, 4369 states have (on average 1.4438086518654154) internal successors, (6308), 4369 states have internal predecessors, (6308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4370 states to 4370 states and 6308 transitions. [2025-02-05 16:41:55,124 INFO L78 Accepts]: Start accepts. Automaton has 4370 states and 6308 transitions. Word has length 89 [2025-02-05 16:41:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:55,124 INFO L471 AbstractCegarLoop]: Abstraction has 4370 states and 6308 transitions. [2025-02-05 16:41:55,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4370 states and 6308 transitions. [2025-02-05 16:41:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:41:55,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:55,125 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] [2025-02-05 16:41:55,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:41:55,125 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:55,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash -158302522, now seen corresponding path program 1 times [2025-02-05 16:41:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:55,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793503108] [2025-02-05 16:41:55,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:55,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:55,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:41:55,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:41:55,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:55,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:55,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:55,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793503108] [2025-02-05 16:41:55,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793503108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:55,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:55,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:41:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098713152] [2025-02-05 16:41:55,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:55,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:41:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:55,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:41:55,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:41:55,709 INFO L87 Difference]: Start difference. First operand 4370 states and 6308 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:56,627 INFO L93 Difference]: Finished difference Result 18402 states and 26712 transitions. [2025-02-05 16:41:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:41:56,628 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 16:41:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:56,642 INFO L225 Difference]: With dead ends: 18402 [2025-02-05 16:41:56,643 INFO L226 Difference]: Without dead ends: 17050 [2025-02-05 16:41:56,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:41:56,648 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 810 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:56,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 3439 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17050 states. [2025-02-05 16:41:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17050 to 4339. [2025-02-05 16:41:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4339 states, 4338 states have (on average 1.4449054863992623) internal successors, (6268), 4338 states have internal predecessors, (6268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 6268 transitions. [2025-02-05 16:41:56,791 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 6268 transitions. Word has length 89 [2025-02-05 16:41:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:56,791 INFO L471 AbstractCegarLoop]: Abstraction has 4339 states and 6268 transitions. [2025-02-05 16:41:56,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 6268 transitions. [2025-02-05 16:41:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:41:56,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:56,793 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] [2025-02-05 16:41:56,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:41:56,793 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:56,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:56,794 INFO L85 PathProgramCache]: Analyzing trace with hash 831355213, now seen corresponding path program 1 times [2025-02-05 16:41:56,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:56,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808891004] [2025-02-05 16:41:56,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:56,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:41:56,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:41:56,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:56,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808891004] [2025-02-05 16:41:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808891004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:57,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:57,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:41:57,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001177123] [2025-02-05 16:41:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:57,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:41:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:57,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:41:57,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:41:57,216 INFO L87 Difference]: Start difference. First operand 4339 states and 6268 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:57,546 INFO L93 Difference]: Finished difference Result 9454 states and 13719 transitions. [2025-02-05 16:41:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:41:57,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-02-05 16:41:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:57,552 INFO L225 Difference]: With dead ends: 9454 [2025-02-05 16:41:57,552 INFO L226 Difference]: Without dead ends: 8317 [2025-02-05 16:41:57,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:41:57,555 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 730 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:57,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1027 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8317 states. [2025-02-05 16:41:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8317 to 4211. [2025-02-05 16:41:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4211 states, 4210 states have (on average 1.4465558194774346) internal successors, (6090), 4210 states have internal predecessors, (6090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 6090 transitions. [2025-02-05 16:41:57,649 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 6090 transitions. Word has length 90 [2025-02-05 16:41:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:57,649 INFO L471 AbstractCegarLoop]: Abstraction has 4211 states and 6090 transitions. [2025-02-05 16:41:57,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 6090 transitions. [2025-02-05 16:41:57,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 16:41:57,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:57,652 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] [2025-02-05 16:41:57,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:41:57,652 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:57,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:57,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1128028138, now seen corresponding path program 1 times [2025-02-05 16:41:57,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:57,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911518826] [2025-02-05 16:41:57,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:57,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:57,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 16:41:57,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 16:41:57,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:57,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:57,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911518826] [2025-02-05 16:41:57,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911518826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:57,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:57,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160201721] [2025-02-05 16:41:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:57,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:57,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:57,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:57,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:57,785 INFO L87 Difference]: Start difference. First operand 4211 states and 6090 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:57,822 INFO L93 Difference]: Finished difference Result 8841 states and 12831 transitions. [2025-02-05 16:41:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:57,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-02-05 16:41:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:57,829 INFO L225 Difference]: With dead ends: 8841 [2025-02-05 16:41:57,830 INFO L226 Difference]: Without dead ends: 5915 [2025-02-05 16:41:57,835 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-02-05 16:41:57,835 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 83 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 395 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-02-05 16:41:57,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 395 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2025-02-05 16:41:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 5697. [2025-02-05 16:41:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5697 states, 5696 states have (on average 1.4396067415730338) internal successors, (8200), 5696 states have internal predecessors, (8200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 8200 transitions. [2025-02-05 16:41:57,920 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 8200 transitions. Word has length 117 [2025-02-05 16:41:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:57,921 INFO L471 AbstractCegarLoop]: Abstraction has 5697 states and 8200 transitions. [2025-02-05 16:41:57,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 8200 transitions. [2025-02-05 16:41:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:41:57,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:57,922 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] [2025-02-05 16:41:57,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:41:57,923 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:57,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash 748892462, now seen corresponding path program 1 times [2025-02-05 16:41:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:57,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088722959] [2025-02-05 16:41:57,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:57,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:41:57,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:41:57,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:57,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:58,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:58,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088722959] [2025-02-05 16:41:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088722959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:58,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:58,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:58,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741559036] [2025-02-05 16:41:58,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:58,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:58,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:58,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:58,043 INFO L87 Difference]: Start difference. First operand 5697 states and 8200 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:58,331 INFO L93 Difference]: Finished difference Result 15173 states and 22020 transitions. [2025-02-05 16:41:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:41:58,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-02-05 16:41:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:58,343 INFO L225 Difference]: With dead ends: 15173 [2025-02-05 16:41:58,343 INFO L226 Difference]: Without dead ends: 9601 [2025-02-05 16:41:58,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:41:58,354 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 873 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:58,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 410 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9601 states. [2025-02-05 16:41:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9601 to 6183. [2025-02-05 16:41:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6183 states, 6182 states have (on average 1.435619540601747) internal successors, (8875), 6182 states have internal predecessors, (8875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 8875 transitions. [2025-02-05 16:41:58,433 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 8875 transitions. Word has length 119 [2025-02-05 16:41:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:58,434 INFO L471 AbstractCegarLoop]: Abstraction has 6183 states and 8875 transitions. [2025-02-05 16:41:58,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 8875 transitions. [2025-02-05 16:41:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:41:58,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:58,436 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] [2025-02-05 16:41:58,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:41:58,436 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:58,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1352538514, now seen corresponding path program 1 times [2025-02-05 16:41:58,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:58,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578262633] [2025-02-05 16:41:58,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:58,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:58,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:41:58,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:41:58,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:58,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:58,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578262633] [2025-02-05 16:41:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578262633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128613613] [2025-02-05 16:41:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:58,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:58,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:58,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:58,552 INFO L87 Difference]: Start difference. First operand 6183 states and 8875 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:58,864 INFO L93 Difference]: Finished difference Result 24463 states and 35507 transitions. [2025-02-05 16:41:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:41:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-02-05 16:41:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:58,885 INFO L225 Difference]: With dead ends: 24463 [2025-02-05 16:41:58,885 INFO L226 Difference]: Without dead ends: 18423 [2025-02-05 16:41:58,894 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-02-05 16:41:58,895 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1019 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:58,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 342 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18423 states. [2025-02-05 16:41:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18423 to 13221. [2025-02-05 16:41:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13221 states, 13220 states have (on average 1.4364599092284418) internal successors, (18990), 13220 states have internal predecessors, (18990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13221 states to 13221 states and 18990 transitions. [2025-02-05 16:41:59,058 INFO L78 Accepts]: Start accepts. Automaton has 13221 states and 18990 transitions. Word has length 119 [2025-02-05 16:41:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:59,058 INFO L471 AbstractCegarLoop]: Abstraction has 13221 states and 18990 transitions. [2025-02-05 16:41:59,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 13221 states and 18990 transitions. [2025-02-05 16:41:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:41:59,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:59,060 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] [2025-02-05 16:41:59,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:41:59,060 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:59,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1006946932, now seen corresponding path program 1 times [2025-02-05 16:41:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207555226] [2025-02-05 16:41:59,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:59,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:41:59,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:41:59,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:59,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:59,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:59,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207555226] [2025-02-05 16:41:59,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207555226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:59,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:59,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471394891] [2025-02-05 16:41:59,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:59,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:41:59,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:59,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:41:59,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:41:59,174 INFO L87 Difference]: Start difference. First operand 13221 states and 18990 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:59,476 INFO L93 Difference]: Finished difference Result 43777 states and 63052 transitions. [2025-02-05 16:41:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:41:59,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-02-05 16:41:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:59,515 INFO L225 Difference]: With dead ends: 43777 [2025-02-05 16:41:59,515 INFO L226 Difference]: Without dead ends: 30699 [2025-02-05 16:41:59,536 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-02-05 16:41:59,537 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 849 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:59,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 338 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30699 states. [2025-02-05 16:41:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30699 to 28297. [2025-02-05 16:41:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28297 states, 28296 states have (on average 1.4355385920271417) internal successors, (40620), 28296 states have internal predecessors, (40620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28297 states to 28297 states and 40620 transitions. [2025-02-05 16:41:59,946 INFO L78 Accepts]: Start accepts. Automaton has 28297 states and 40620 transitions. Word has length 119 [2025-02-05 16:41:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:59,947 INFO L471 AbstractCegarLoop]: Abstraction has 28297 states and 40620 transitions. [2025-02-05 16:41:59,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 28297 states and 40620 transitions. [2025-02-05 16:41:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:41:59,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:59,948 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] [2025-02-05 16:41:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:41:59,949 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 283343116, now seen corresponding path program 1 times [2025-02-05 16:41:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013181900] [2025-02-05 16:41:59,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:59,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:41:59,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:41:59,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:59,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:00,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:00,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013181900] [2025-02-05 16:42:00,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013181900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:00,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:00,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:42:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567578686] [2025-02-05 16:42:00,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:00,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:42:00,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:00,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:42:00,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:42:00,058 INFO L87 Difference]: Start difference. First operand 28297 states and 40620 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:00,433 INFO L93 Difference]: Finished difference Result 98605 states and 142342 transitions. [2025-02-05 16:42:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:42:00,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-02-05 16:42:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:00,510 INFO L225 Difference]: With dead ends: 98605 [2025-02-05 16:42:00,510 INFO L226 Difference]: Without dead ends: 70451 [2025-02-05 16:42:00,543 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-02-05 16:42:00,543 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 934 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:00,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 340 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:42:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70451 states. [2025-02-05 16:42:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70451 to 60449. [2025-02-05 16:42:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60449 states, 60448 states have (on average 1.433959767072525) internal successors, (86680), 60448 states have internal predecessors, (86680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60449 states to 60449 states and 86680 transitions. [2025-02-05 16:42:01,470 INFO L78 Accepts]: Start accepts. Automaton has 60449 states and 86680 transitions. Word has length 119 [2025-02-05 16:42:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:01,471 INFO L471 AbstractCegarLoop]: Abstraction has 60449 states and 86680 transitions. [2025-02-05 16:42:01,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 60449 states and 86680 transitions. [2025-02-05 16:42:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 16:42:01,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:01,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:42:01,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:42:01,487 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:01,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:01,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1519514395, now seen corresponding path program 1 times [2025-02-05 16:42:01,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:01,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892548774] [2025-02-05 16:42:01,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:01,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:01,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:42:01,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:42:01,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:01,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 16:42:01,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892548774] [2025-02-05 16:42:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892548774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:01,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:01,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:01,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746639836] [2025-02-05 16:42:01,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:01,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:01,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:01,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:01,647 INFO L87 Difference]: Start difference. First operand 60449 states and 86680 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:01,958 INFO L93 Difference]: Finished difference Result 116533 states and 166770 transitions. [2025-02-05 16:42:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 146 [2025-02-05 16:42:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:02,028 INFO L225 Difference]: With dead ends: 116533 [2025-02-05 16:42:02,029 INFO L226 Difference]: Without dead ends: 56221 [2025-02-05 16:42:02,077 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-02-05 16:42:02,078 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 384 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-02-05 16:42:02,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 384 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56221 states. [2025-02-05 16:42:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56221 to 54959. [2025-02-05 16:42:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54959 states, 54958 states have (on average 1.4202663852396376) internal successors, (78055), 54958 states have internal predecessors, (78055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54959 states to 54959 states and 78055 transitions. [2025-02-05 16:42:02,876 INFO L78 Accepts]: Start accepts. Automaton has 54959 states and 78055 transitions. Word has length 146 [2025-02-05 16:42:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:02,876 INFO L471 AbstractCegarLoop]: Abstraction has 54959 states and 78055 transitions. [2025-02-05 16:42:02,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 54959 states and 78055 transitions. [2025-02-05 16:42:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 16:42:02,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:02,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:42:02,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:42:02,885 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:02,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1159891492, now seen corresponding path program 1 times [2025-02-05 16:42:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:02,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814377122] [2025-02-05 16:42:02,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:02,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 16:42:02,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 16:42:02,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:02,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 16:42:02,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814377122] [2025-02-05 16:42:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814377122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:03,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:03,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397705589] [2025-02-05 16:42:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:03,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:03,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:03,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:03,001 INFO L87 Difference]: Start difference. First operand 54959 states and 78055 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:03,227 INFO L93 Difference]: Finished difference Result 105595 states and 149577 transitions. [2025-02-05 16:42:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:03,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 147 [2025-02-05 16:42:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:03,518 INFO L225 Difference]: With dead ends: 105595 [2025-02-05 16:42:03,518 INFO L226 Difference]: Without dead ends: 50761 [2025-02-05 16:42:03,546 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-02-05 16:42:03,547 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 69 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 385 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-02-05 16:42:03,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50761 states. [2025-02-05 16:42:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50761 to 49559. [2025-02-05 16:42:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49559 states, 49558 states have (on average 1.405524839581904) internal successors, (69655), 49558 states have internal predecessors, (69655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49559 states to 49559 states and 69655 transitions. [2025-02-05 16:42:04,131 INFO L78 Accepts]: Start accepts. Automaton has 49559 states and 69655 transitions. Word has length 147 [2025-02-05 16:42:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:04,131 INFO L471 AbstractCegarLoop]: Abstraction has 49559 states and 69655 transitions. [2025-02-05 16:42:04,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 49559 states and 69655 transitions. [2025-02-05 16:42:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:42:04,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:04,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 16:42:04,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:42:04,138 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:04,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1775608462, now seen corresponding path program 1 times [2025-02-05 16:42:04,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:04,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062854796] [2025-02-05 16:42:04,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:04,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:04,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:42:04,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:42:04,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:04,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:42:04,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:04,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062854796] [2025-02-05 16:42:04,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062854796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:04,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:04,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:04,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853271115] [2025-02-05 16:42:04,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:04,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:04,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:04,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:04,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:04,296 INFO L87 Difference]: Start difference. First operand 49559 states and 69655 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-02-05 16:42:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:04,583 INFO L93 Difference]: Finished difference Result 94795 states and 132777 transitions. [2025-02-05 16:42:04,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:04,584 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 148 [2025-02-05 16:42:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:04,641 INFO L225 Difference]: With dead ends: 94795 [2025-02-05 16:42:04,641 INFO L226 Difference]: Without dead ends: 45361 [2025-02-05 16:42:04,674 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-02-05 16:42:04,675 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 62 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 386 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-02-05 16:42:04,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 386 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45361 states. [2025-02-05 16:42:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45361 to 44159. [2025-02-05 16:42:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44159 states, 44158 states have (on average 1.3871778613161827) internal successors, (61255), 44158 states have internal predecessors, (61255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44159 states to 44159 states and 61255 transitions. [2025-02-05 16:42:05,424 INFO L78 Accepts]: Start accepts. Automaton has 44159 states and 61255 transitions. Word has length 148 [2025-02-05 16:42:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:05,424 INFO L471 AbstractCegarLoop]: Abstraction has 44159 states and 61255 transitions. [2025-02-05 16:42:05,424 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-02-05 16:42:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 44159 states and 61255 transitions. [2025-02-05 16:42:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:42:05,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:05,428 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 16:42:05,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:42:05,429 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:05,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1305806063, now seen corresponding path program 1 times [2025-02-05 16:42:05,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:05,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790301515] [2025-02-05 16:42:05,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:05,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:05,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:42:05,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:42:05,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:05,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:42:05,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:05,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790301515] [2025-02-05 16:42:05,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790301515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:42:05,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:42:05,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:42:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978528328] [2025-02-05 16:42:05,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:42:05,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:42:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:05,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:42:05,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:42:05,535 INFO L87 Difference]: Start difference. First operand 44159 states and 61255 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:05,735 INFO L93 Difference]: Finished difference Result 127827 states and 176297 transitions. [2025-02-05 16:42:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:42:05,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 149 [2025-02-05 16:42:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:05,822 INFO L225 Difference]: With dead ends: 127827 [2025-02-05 16:42:05,822 INFO L226 Difference]: Without dead ends: 83793 [2025-02-05 16:42:05,865 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-02-05 16:42:05,865 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 55 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 387 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-02-05 16:42:05,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 387 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:42:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83793 states. [2025-02-05 16:42:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83793 to 78191. [2025-02-05 16:42:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78191 states, 78190 states have (on average 1.3706995779511446) internal successors, (107175), 78190 states have internal predecessors, (107175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78191 states to 78191 states and 107175 transitions. [2025-02-05 16:42:07,001 INFO L78 Accepts]: Start accepts. Automaton has 78191 states and 107175 transitions. Word has length 149 [2025-02-05 16:42:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:07,002 INFO L471 AbstractCegarLoop]: Abstraction has 78191 states and 107175 transitions. [2025-02-05 16:42:07,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 78191 states and 107175 transitions. [2025-02-05 16:42:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 16:42:07,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:07,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 16:42:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:42:07,008 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1207923714, now seen corresponding path program 1 times [2025-02-05 16:42:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996823560] [2025-02-05 16:42:07,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:42:07,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:42:07,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:07,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996823560] [2025-02-05 16:42:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996823560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:42:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224700557] [2025-02-05 16:42:07,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:07,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:42:07,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:42:07,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:42:07,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:42:07,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:42:07,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:07,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:07,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:42:07,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:42:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:08,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:42:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224700557] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:42:10,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:42:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-05 16:42:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604205944] [2025-02-05 16:42:10,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:42:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:42:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:10,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:42:10,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:42:10,476 INFO L87 Difference]: Start difference. First operand 78191 states and 107175 transitions. Second operand has 28 states, 28 states have (on average 13.857142857142858) internal successors, (388), 27 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:12,246 INFO L93 Difference]: Finished difference Result 320197 states and 438822 transitions. [2025-02-05 16:42:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 16:42:12,247 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.857142857142858) internal successors, (388), 27 states have internal predecessors, (388), 0 states have call successors, (0), 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 150 [2025-02-05 16:42:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:12,579 INFO L225 Difference]: With dead ends: 320197 [2025-02-05 16:42:12,579 INFO L226 Difference]: Without dead ends: 242131 [2025-02-05 16:42:12,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=557, Invalid=1795, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 16:42:12,682 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 2310 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:12,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 1268 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:42:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242131 states. [2025-02-05 16:42:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242131 to 186311. [2025-02-05 16:42:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186311 states, 186310 states have (on average 1.366641618807364) internal successors, (254619), 186310 states have internal predecessors, (254619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186311 states to 186311 states and 254619 transitions. [2025-02-05 16:42:15,887 INFO L78 Accepts]: Start accepts. Automaton has 186311 states and 254619 transitions. Word has length 150 [2025-02-05 16:42:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:15,888 INFO L471 AbstractCegarLoop]: Abstraction has 186311 states and 254619 transitions. [2025-02-05 16:42:15,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.857142857142858) internal successors, (388), 27 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:42:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 186311 states and 254619 transitions. [2025-02-05 16:42:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:42:15,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:15,899 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:42:15,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:42:16,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-05 16:42:16,100 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:42:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1998088824, now seen corresponding path program 1 times [2025-02-05 16:42:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205964892] [2025-02-05 16:42:16,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:16,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:42:16,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:42:16,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:16,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205964892] [2025-02-05 16:42:16,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205964892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:42:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191266905] [2025-02-05 16:42:16,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:16,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:42:16,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:42:16,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:42:17,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:42:17,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:42:17,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:17,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:17,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:42:17,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:42:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:17,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:42:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191266905] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:42:19,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:42:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 34 [2025-02-05 16:42:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824563134] [2025-02-05 16:42:19,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:42:19,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 16:42:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:19,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 16:42:19,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:42:19,219 INFO L87 Difference]: Start difference. First operand 186311 states and 254619 transitions. Second operand has 35 states, 35 states have (on average 11.771428571428572) internal successors, (412), 34 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)