./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.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-var-start-time.4.ufo.BOUNDED-8.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 5aad5fd4611705ad6fdf71db638f2162c13b3da201193a54a746a0dc7cc3072f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:35:02,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:35:02,254 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:35:02,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:35:02,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:35:02,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:35:02,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:35:02,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:35:02,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:35:02,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:35:02,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:35:02,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:35:02,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:35:02,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:35:02,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:35:02,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:35:02,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:35:02,274 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 -> 5aad5fd4611705ad6fdf71db638f2162c13b3da201193a54a746a0dc7cc3072f [2025-02-05 16:35:02,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:35:02,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:35:02,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:35:02,521 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:35:02,522 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:35:02,522 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:35:03,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/695477fee/a89577f896a04fd4b7e1844ae2a444fa/FLAGeaad1df04 [2025-02-05 16:35:03,953 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:35:03,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:35:03,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/695477fee/a89577f896a04fd4b7e1844ae2a444fa/FLAGeaad1df04 [2025-02-05 16:35:04,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/695477fee/a89577f896a04fd4b7e1844ae2a444fa [2025-02-05 16:35:04,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:35:04,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:35:04,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:35:04,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:35:04,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:35:04,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218c6182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04, skipping insertion in model container [2025-02-05 16:35:04,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:35:04,471 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7251,7264] [2025-02-05 16:35:04,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:35:04,543 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:35:04,582 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7251,7264] [2025-02-05 16:35:04,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:35:04,640 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:35:04,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04 WrapperNode [2025-02-05 16:35:04,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:35:04,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:35:04,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:35:04,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:35:04,647 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:35:04" (1/1) ... [2025-02-05 16:35:04,655 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:35:04" (1/1) ... [2025-02-05 16:35:04,679 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 736 [2025-02-05 16:35:04,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:35:04,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:35:04,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:35:04,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:35:04,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,701 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:35:04,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:35:04,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:35:04,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:35:04,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:35:04,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (1/1) ... [2025-02-05 16:35:04,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:35:04,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:35:04,737 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:35:04,739 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:35:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:35:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:35:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:35:04,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:35:04,856 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:35:04,858 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:35:05,341 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1076: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L387: 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_~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_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node2__m2~2#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L424: havoc main_~node3__m3~2#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L442: havoc main_~node4__m4~2#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1120: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L988: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L164: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L776: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:05,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L662: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:05,371 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-05 16:35:05,371 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:35:05,379 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:35:05,379 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:35:05,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:35:05 BoogieIcfgContainer [2025-02-05 16:35:05,380 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:35:05,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:35:05,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:35:05,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:35:05,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:35:04" (1/3) ... [2025-02-05 16:35:05,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7451d7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:35:05, skipping insertion in model container [2025-02-05 16:35:05,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:04" (2/3) ... [2025-02-05 16:35:05,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7451d7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:35:05, skipping insertion in model container [2025-02-05 16:35:05,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:35:05" (3/3) ... [2025-02-05 16:35:05,386 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:35:05,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:35:05,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 180 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:35:05,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:35:05,443 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;@31494412, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:35:05,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:35:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 0 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:35:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:35:05,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:05,454 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] [2025-02-05 16:35:05,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:05,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1757487568, now seen corresponding path program 1 times [2025-02-05 16:35:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696354547] [2025-02-05 16:35:05,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:05,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:35:05,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:35:05,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:05,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:05,915 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:35:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:05,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696354547] [2025-02-05 16:35:05,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696354547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:05,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798362076] [2025-02-05 16:35:05,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:05,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:05,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:05,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:05,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:05,932 INFO L87 Difference]: Start difference. First operand has 180 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:35:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:06,126 INFO L93 Difference]: Finished difference Result 640 states and 1036 transitions. [2025-02-05 16:35:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:06,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-02-05 16:35:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:06,141 INFO L225 Difference]: With dead ends: 640 [2025-02-05 16:35:06,142 INFO L226 Difference]: Without dead ends: 541 [2025-02-05 16:35:06,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:06,145 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1465 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:06,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 1395 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-05 16:35:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 275. [2025-02-05 16:35:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 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) [2025-02-05 16:35:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 412 transitions. [2025-02-05 16:35:06,197 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 412 transitions. Word has length 65 [2025-02-05 16:35:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:06,197 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 412 transitions. [2025-02-05 16:35:06,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:35:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 412 transitions. [2025-02-05 16:35:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:35:06,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:06,199 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] [2025-02-05 16:35:06,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:35:06,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:06,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:06,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1351499395, now seen corresponding path program 1 times [2025-02-05 16:35:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:06,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623364849] [2025-02-05 16:35:06,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:06,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:35:06,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:35:06,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:06,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:06,583 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:35:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623364849] [2025-02-05 16:35:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623364849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419506640] [2025-02-05 16:35:06,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:06,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:06,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:06,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:06,585 INFO L87 Difference]: Start difference. First operand 275 states and 412 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:35:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:06,767 INFO L93 Difference]: Finished difference Result 1013 states and 1556 transitions. [2025-02-05 16:35:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:06,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-02-05 16:35:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:06,770 INFO L225 Difference]: With dead ends: 1013 [2025-02-05 16:35:06,770 INFO L226 Difference]: Without dead ends: 801 [2025-02-05 16:35:06,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:06,774 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1687 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:06,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 702 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-02-05 16:35:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 795. [2025-02-05 16:35:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 0 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:35:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1211 transitions. [2025-02-05 16:35:06,808 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1211 transitions. Word has length 66 [2025-02-05 16:35:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:06,809 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1211 transitions. [2025-02-05 16:35:06,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:35:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1211 transitions. [2025-02-05 16:35:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:06,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:06,815 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] [2025-02-05 16:35:06,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:35:06,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:06,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:06,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1014158194, now seen corresponding path program 1 times [2025-02-05 16:35:06,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:06,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489286560] [2025-02-05 16:35:06,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:06,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:06,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:06,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:06,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:06,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:06,970 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:35:06,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489286560] [2025-02-05 16:35:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489286560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:06,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:06,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:06,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133402402] [2025-02-05 16:35:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:06,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:06,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:06,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:06,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:06,973 INFO L87 Difference]: Start difference. First operand 795 states and 1211 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:35:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:07,174 INFO L93 Difference]: Finished difference Result 2017 states and 3117 transitions. [2025-02-05 16:35:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:35:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:07,183 INFO L225 Difference]: With dead ends: 2017 [2025-02-05 16:35:07,184 INFO L226 Difference]: Without dead ends: 1323 [2025-02-05 16:35:07,185 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:35:07,186 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 930 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:07,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 250 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-02-05 16:35:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2025-02-05 16:35:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.5340909090909092) internal successors, (2025), 1320 states have internal predecessors, (2025), 0 states have call successors, (0), 0 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:35:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2025 transitions. [2025-02-05 16:35:07,242 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2025 transitions. Word has length 67 [2025-02-05 16:35:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:07,242 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 2025 transitions. [2025-02-05 16:35:07,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:35:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2025 transitions. [2025-02-05 16:35:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:07,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:07,246 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] [2025-02-05 16:35:07,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:35:07,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:07,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2042450118, now seen corresponding path program 1 times [2025-02-05 16:35:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:07,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346083732] [2025-02-05 16:35:07,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:07,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:07,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:07,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:07,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:07,393 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:35:07,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:07,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346083732] [2025-02-05 16:35:07,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346083732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:07,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:07,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:07,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898320459] [2025-02-05 16:35:07,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:07,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:07,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:07,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:07,395 INFO L87 Difference]: Start difference. First operand 1321 states and 2025 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:35:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:07,654 INFO L93 Difference]: Finished difference Result 3648 states and 5640 transitions. [2025-02-05 16:35:07,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:07,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:35:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:07,664 INFO L225 Difference]: With dead ends: 3648 [2025-02-05 16:35:07,664 INFO L226 Difference]: Without dead ends: 2401 [2025-02-05 16:35:07,668 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:35:07,669 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 956 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:07,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 248 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-02-05 16:35:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2399. [2025-02-05 16:35:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 1.536697247706422) internal successors, (3685), 2398 states have internal predecessors, (3685), 0 states have call successors, (0), 0 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:35:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3685 transitions. [2025-02-05 16:35:07,720 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3685 transitions. Word has length 67 [2025-02-05 16:35:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:07,720 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3685 transitions. [2025-02-05 16:35:07,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:35:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3685 transitions. [2025-02-05 16:35:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:07,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:07,722 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] [2025-02-05 16:35:07,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:35:07,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:07,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 400489446, now seen corresponding path program 1 times [2025-02-05 16:35:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084841068] [2025-02-05 16:35:07,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:07,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:07,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:07,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:07,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:07,853 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:35:07,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:07,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084841068] [2025-02-05 16:35:07,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084841068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:07,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:07,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928403929] [2025-02-05 16:35:07,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:07,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:07,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:07,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:07,856 INFO L87 Difference]: Start difference. First operand 2399 states and 3685 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:35:08,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:08,054 INFO L93 Difference]: Finished difference Result 6925 states and 10693 transitions. [2025-02-05 16:35:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:08,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:35:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:08,070 INFO L225 Difference]: With dead ends: 6925 [2025-02-05 16:35:08,070 INFO L226 Difference]: Without dead ends: 4577 [2025-02-05 16:35:08,075 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:35:08,076 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 982 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:08,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 246 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4577 states. [2025-02-05 16:35:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4577 to 4575. [2025-02-05 16:35:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 0 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:35:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 7018 transitions. [2025-02-05 16:35:08,181 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 7018 transitions. Word has length 67 [2025-02-05 16:35:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:08,182 INFO L471 AbstractCegarLoop]: Abstraction has 4575 states and 7018 transitions. [2025-02-05 16:35:08,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:35:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 7018 transitions. [2025-02-05 16:35:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:08,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:08,184 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] [2025-02-05 16:35:08,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:35:08,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:08,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1276308846, now seen corresponding path program 1 times [2025-02-05 16:35:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243381575] [2025-02-05 16:35:08,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:08,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:08,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:08,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:08,304 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:35:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243381575] [2025-02-05 16:35:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243381575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:08,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:08,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484878519] [2025-02-05 16:35:08,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:08,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:08,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:08,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:08,307 INFO L87 Difference]: Start difference. First operand 4575 states and 7018 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:35:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:08,528 INFO L93 Difference]: Finished difference Result 12541 states and 19291 transitions. [2025-02-05 16:35:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:35:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:08,553 INFO L225 Difference]: With dead ends: 12541 [2025-02-05 16:35:08,553 INFO L226 Difference]: Without dead ends: 8001 [2025-02-05 16:35:08,559 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:35:08,561 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1012 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:08,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 242 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2025-02-05 16:35:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 7999. [2025-02-05 16:35:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7999 states, 7998 states have (on average 1.5250062515628908) internal successors, (12197), 7998 states have internal predecessors, (12197), 0 states have call successors, (0), 0 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:35:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 12197 transitions. [2025-02-05 16:35:08,724 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 12197 transitions. Word has length 67 [2025-02-05 16:35:08,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:08,724 INFO L471 AbstractCegarLoop]: Abstraction has 7999 states and 12197 transitions. [2025-02-05 16:35:08,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:35:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 12197 transitions. [2025-02-05 16:35:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:08,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:08,727 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] [2025-02-05 16:35:08,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:35:08,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:08,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1882816673, now seen corresponding path program 1 times [2025-02-05 16:35:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288448990] [2025-02-05 16:35:08,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:08,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:08,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:08,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:08,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:08,995 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:35:08,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288448990] [2025-02-05 16:35:08,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288448990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:08,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:08,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:35:08,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139538170] [2025-02-05 16:35:08,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:08,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:08,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:08,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:08,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:08,999 INFO L87 Difference]: Start difference. First operand 7999 states and 12197 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:35:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:09,047 INFO L93 Difference]: Finished difference Result 8225 states and 12534 transitions. [2025-02-05 16:35:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:09,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:35:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:09,077 INFO L225 Difference]: With dead ends: 8225 [2025-02-05 16:35:09,077 INFO L226 Difference]: Without dead ends: 8223 [2025-02-05 16:35:09,081 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:35:09,081 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:09,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 966 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8223 states. [2025-02-05 16:35:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8223 to 8223. [2025-02-05 16:35:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 8222 states have (on average 1.510702991972756) internal successors, (12421), 8222 states have internal predecessors, (12421), 0 states have call successors, (0), 0 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:35:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 12421 transitions. [2025-02-05 16:35:09,217 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 12421 transitions. Word has length 68 [2025-02-05 16:35:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:09,217 INFO L471 AbstractCegarLoop]: Abstraction has 8223 states and 12421 transitions. [2025-02-05 16:35:09,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:35:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 12421 transitions. [2025-02-05 16:35:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:09,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:09,219 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] [2025-02-05 16:35:09,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:35:09,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:09,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1766999374, now seen corresponding path program 1 times [2025-02-05 16:35:09,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:09,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250007044] [2025-02-05 16:35:09,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:09,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:09,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:09,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:09,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:09,373 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:35:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250007044] [2025-02-05 16:35:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250007044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:09,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:09,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320632825] [2025-02-05 16:35:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:09,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:35:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:09,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:35:09,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:35:09,374 INFO L87 Difference]: Start difference. First operand 8223 states and 12421 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:35:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:09,423 INFO L93 Difference]: Finished difference Result 22283 states and 33599 transitions. [2025-02-05 16:35:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:35:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:35:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:09,448 INFO L225 Difference]: With dead ends: 22283 [2025-02-05 16:35:09,448 INFO L226 Difference]: Without dead ends: 14633 [2025-02-05 16:35:09,460 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:35:09,461 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 201 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:09,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 610 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14633 states. [2025-02-05 16:35:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14633 to 14631. [2025-02-05 16:35:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14631 states, 14630 states have (on average 1.4958988380041012) internal successors, (21885), 14630 states have internal predecessors, (21885), 0 states have call successors, (0), 0 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:35:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14631 states to 14631 states and 21885 transitions. [2025-02-05 16:35:09,696 INFO L78 Accepts]: Start accepts. Automaton has 14631 states and 21885 transitions. Word has length 69 [2025-02-05 16:35:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:09,696 INFO L471 AbstractCegarLoop]: Abstraction has 14631 states and 21885 transitions. [2025-02-05 16:35:09,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:35:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14631 states and 21885 transitions. [2025-02-05 16:35:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:09,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:09,699 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] [2025-02-05 16:35:09,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:35:09,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1733795456, now seen corresponding path program 1 times [2025-02-05 16:35:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048739614] [2025-02-05 16:35:09,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:09,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:09,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:09,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:09,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:09,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:09,751 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:35:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048739614] [2025-02-05 16:35:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048739614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:09,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:09,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426467043] [2025-02-05 16:35:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:09,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:09,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:09,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:09,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:09,753 INFO L87 Difference]: Start difference. First operand 14631 states and 21885 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:09,892 INFO L93 Difference]: Finished difference Result 32044 states and 47901 transitions. [2025-02-05 16:35:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:09,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:09,921 INFO L225 Difference]: With dead ends: 32044 [2025-02-05 16:35:09,922 INFO L226 Difference]: Without dead ends: 19520 [2025-02-05 16:35:09,935 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:35:09,935 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 164 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:09,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 467 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19520 states. [2025-02-05 16:35:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19520 to 19333. [2025-02-05 16:35:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19333 states, 19332 states have (on average 1.473463687150838) internal successors, (28485), 19332 states have internal predecessors, (28485), 0 states have call successors, (0), 0 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:35:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19333 states to 19333 states and 28485 transitions. [2025-02-05 16:35:10,165 INFO L78 Accepts]: Start accepts. Automaton has 19333 states and 28485 transitions. Word has length 70 [2025-02-05 16:35:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:10,165 INFO L471 AbstractCegarLoop]: Abstraction has 19333 states and 28485 transitions. [2025-02-05 16:35:10,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19333 states and 28485 transitions. [2025-02-05 16:35:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:10,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:10,167 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] [2025-02-05 16:35:10,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:35:10,168 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash 903569409, now seen corresponding path program 1 times [2025-02-05 16:35:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:10,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055664284] [2025-02-05 16:35:10,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:10,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:10,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:10,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:10,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:10,218 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:35:10,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:10,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055664284] [2025-02-05 16:35:10,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055664284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:10,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:10,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:10,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630643288] [2025-02-05 16:35:10,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:10,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:10,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:10,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:10,220 INFO L87 Difference]: Start difference. First operand 19333 states and 28485 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:10,382 INFO L93 Difference]: Finished difference Result 34788 states and 51067 transitions. [2025-02-05 16:35:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:10,415 INFO L225 Difference]: With dead ends: 34788 [2025-02-05 16:35:10,416 INFO L226 Difference]: Without dead ends: 22398 [2025-02-05 16:35:10,431 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:35:10,431 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 152 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:10,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 484 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22398 states. [2025-02-05 16:35:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22398 to 22159. [2025-02-05 16:35:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22159 states, 22158 states have (on average 1.443722357613503) internal successors, (31990), 22158 states have internal predecessors, (31990), 0 states have call successors, (0), 0 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:35:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22159 states to 22159 states and 31990 transitions. [2025-02-05 16:35:10,757 INFO L78 Accepts]: Start accepts. Automaton has 22159 states and 31990 transitions. Word has length 70 [2025-02-05 16:35:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:10,758 INFO L471 AbstractCegarLoop]: Abstraction has 22159 states and 31990 transitions. [2025-02-05 16:35:10,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 22159 states and 31990 transitions. [2025-02-05 16:35:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:10,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:10,760 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] [2025-02-05 16:35:10,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:35:10,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:10,762 INFO L85 PathProgramCache]: Analyzing trace with hash 574085408, now seen corresponding path program 1 times [2025-02-05 16:35:10,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:10,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660413680] [2025-02-05 16:35:10,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:10,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:10,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:10,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:10,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:10,892 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:35:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:10,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660413680] [2025-02-05 16:35:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660413680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273471159] [2025-02-05 16:35:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:10,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:10,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:10,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:10,893 INFO L87 Difference]: Start difference. First operand 22159 states and 31990 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:11,176 INFO L93 Difference]: Finished difference Result 43324 states and 62743 transitions. [2025-02-05 16:35:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:11,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:11,238 INFO L225 Difference]: With dead ends: 43324 [2025-02-05 16:35:11,239 INFO L226 Difference]: Without dead ends: 38930 [2025-02-05 16:35:11,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:11,249 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1146 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:11,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1290 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38930 states. [2025-02-05 16:35:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38930 to 26493. [2025-02-05 16:35:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26493 states, 26492 states have (on average 1.4408878151894913) internal successors, (38172), 26492 states have internal predecessors, (38172), 0 states have call successors, (0), 0 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:35:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 38172 transitions. [2025-02-05 16:35:11,800 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 38172 transitions. Word has length 70 [2025-02-05 16:35:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:11,801 INFO L471 AbstractCegarLoop]: Abstraction has 26493 states and 38172 transitions. [2025-02-05 16:35:11,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 38172 transitions. [2025-02-05 16:35:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:11,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:11,807 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] [2025-02-05 16:35:11,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:35:11,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:11,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash 661224353, now seen corresponding path program 1 times [2025-02-05 16:35:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918685665] [2025-02-05 16:35:11,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:11,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:11,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:11,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:11,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:11,897 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:35:11,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918685665] [2025-02-05 16:35:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918685665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:11,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:11,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144428362] [2025-02-05 16:35:11,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:11,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:11,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:11,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:11,899 INFO L87 Difference]: Start difference. First operand 26493 states and 38172 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:12,035 INFO L93 Difference]: Finished difference Result 58687 states and 84388 transitions. [2025-02-05 16:35:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:12,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:12,094 INFO L225 Difference]: With dead ends: 58687 [2025-02-05 16:35:12,095 INFO L226 Difference]: Without dead ends: 34472 [2025-02-05 16:35:12,119 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:35:12,119 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 173 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:12,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 463 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34472 states. [2025-02-05 16:35:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34472 to 34364. [2025-02-05 16:35:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34364 states, 34363 states have (on average 1.4161743735995111) internal successors, (48664), 34363 states have internal predecessors, (48664), 0 states have call successors, (0), 0 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:35:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34364 states to 34364 states and 48664 transitions. [2025-02-05 16:35:12,524 INFO L78 Accepts]: Start accepts. Automaton has 34364 states and 48664 transitions. Word has length 70 [2025-02-05 16:35:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:12,524 INFO L471 AbstractCegarLoop]: Abstraction has 34364 states and 48664 transitions. [2025-02-05 16:35:12,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34364 states and 48664 transitions. [2025-02-05 16:35:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:12,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:12,529 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] [2025-02-05 16:35:12,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:35:12,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:12,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1568873343, now seen corresponding path program 1 times [2025-02-05 16:35:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:12,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32829841] [2025-02-05 16:35:12,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:12,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:12,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:12,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:12,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32829841] [2025-02-05 16:35:12,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32829841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:12,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:12,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480636113] [2025-02-05 16:35:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:12,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:12,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:12,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:12,632 INFO L87 Difference]: Start difference. First operand 34364 states and 48664 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:12,963 INFO L93 Difference]: Finished difference Result 66199 states and 94238 transitions. [2025-02-05 16:35:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:13,051 INFO L225 Difference]: With dead ends: 66199 [2025-02-05 16:35:13,052 INFO L226 Difference]: Without dead ends: 58157 [2025-02-05 16:35:13,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:13,070 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 1037 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:13,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1165 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58157 states. [2025-02-05 16:35:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58157 to 42329. [2025-02-05 16:35:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42329 states, 42328 states have (on average 1.4155641655641655) internal successors, (59918), 42328 states have internal predecessors, (59918), 0 states have call successors, (0), 0 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:35:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42329 states to 42329 states and 59918 transitions. [2025-02-05 16:35:13,724 INFO L78 Accepts]: Start accepts. Automaton has 42329 states and 59918 transitions. Word has length 70 [2025-02-05 16:35:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:13,724 INFO L471 AbstractCegarLoop]: Abstraction has 42329 states and 59918 transitions. [2025-02-05 16:35:13,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42329 states and 59918 transitions. [2025-02-05 16:35:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:13,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:13,729 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] [2025-02-05 16:35:13,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:35:13,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:13,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2070599040, now seen corresponding path program 1 times [2025-02-05 16:35:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654386228] [2025-02-05 16:35:13,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:13,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:13,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:13,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:13,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:13,844 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:35:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654386228] [2025-02-05 16:35:13,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654386228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:13,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:13,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:13,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386884545] [2025-02-05 16:35:13,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:13,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:13,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:13,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:13,846 INFO L87 Difference]: Start difference. First operand 42329 states and 59918 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:14,210 INFO L93 Difference]: Finished difference Result 77620 states and 110486 transitions. [2025-02-05 16:35:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:14,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:14,290 INFO L225 Difference]: With dead ends: 77620 [2025-02-05 16:35:14,290 INFO L226 Difference]: Without dead ends: 66026 [2025-02-05 16:35:14,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:14,311 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1103 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:14,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1309 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66026 states. [2025-02-05 16:35:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66026 to 50640. [2025-02-05 16:35:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50640 states, 50639 states have (on average 1.4174845474831652) internal successors, (71780), 50639 states have internal predecessors, (71780), 0 states have call successors, (0), 0 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:35:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50640 states to 50640 states and 71780 transitions. [2025-02-05 16:35:14,998 INFO L78 Accepts]: Start accepts. Automaton has 50640 states and 71780 transitions. Word has length 70 [2025-02-05 16:35:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:14,998 INFO L471 AbstractCegarLoop]: Abstraction has 50640 states and 71780 transitions. [2025-02-05 16:35:14,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 50640 states and 71780 transitions. [2025-02-05 16:35:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:15,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:15,010 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] [2025-02-05 16:35:15,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:35:15,010 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:15,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1167374047, now seen corresponding path program 1 times [2025-02-05 16:35:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428967301] [2025-02-05 16:35:15,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:15,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:15,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:15,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:15,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:15,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:35:15,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:15,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428967301] [2025-02-05 16:35:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428967301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:15,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:15,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380615240] [2025-02-05 16:35:15,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:15,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:15,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:15,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:15,133 INFO L87 Difference]: Start difference. First operand 50640 states and 71780 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:15,409 INFO L93 Difference]: Finished difference Result 87381 states and 124314 transitions. [2025-02-05 16:35:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:15,515 INFO L225 Difference]: With dead ends: 87381 [2025-02-05 16:35:15,515 INFO L226 Difference]: Without dead ends: 75665 [2025-02-05 16:35:15,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:15,549 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1114 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:15,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1092 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75665 states. [2025-02-05 16:35:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75665 to 55849. [2025-02-05 16:35:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55849 states, 55848 states have (on average 1.4180633147113595) internal successors, (79196), 55848 states have internal predecessors, (79196), 0 states have call successors, (0), 0 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:35:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55849 states to 55849 states and 79196 transitions. [2025-02-05 16:35:16,468 INFO L78 Accepts]: Start accepts. Automaton has 55849 states and 79196 transitions. Word has length 70 [2025-02-05 16:35:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:16,468 INFO L471 AbstractCegarLoop]: Abstraction has 55849 states and 79196 transitions. [2025-02-05 16:35:16,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:35:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 55849 states and 79196 transitions. [2025-02-05 16:35:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:35:16,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:16,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:16,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:35:16,474 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:16,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2063564947, now seen corresponding path program 1 times [2025-02-05 16:35:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:16,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049199903] [2025-02-05 16:35:16,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:16,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:35:16,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:35:16,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:16,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:16,537 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:35:16,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049199903] [2025-02-05 16:35:16,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049199903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:16,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305270702] [2025-02-05 16:35:16,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:16,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:16,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:16,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:16,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:16,541 INFO L87 Difference]: Start difference. First operand 55849 states and 79196 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:16,754 INFO L93 Difference]: Finished difference Result 83481 states and 117611 transitions. [2025-02-05 16:35:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 16:35:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:16,820 INFO L225 Difference]: With dead ends: 83481 [2025-02-05 16:35:16,820 INFO L226 Difference]: Without dead ends: 53257 [2025-02-05 16:35:16,847 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:35:16,848 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 138 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:16,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 554 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53257 states. [2025-02-05 16:35:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53257 to 46978. [2025-02-05 16:35:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46978 states, 46977 states have (on average 1.39008450944079) internal successors, (65302), 46977 states have internal predecessors, (65302), 0 states have call successors, (0), 0 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:35:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46978 states to 46978 states and 65302 transitions. [2025-02-05 16:35:17,644 INFO L78 Accepts]: Start accepts. Automaton has 46978 states and 65302 transitions. Word has length 73 [2025-02-05 16:35:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:17,644 INFO L471 AbstractCegarLoop]: Abstraction has 46978 states and 65302 transitions. [2025-02-05 16:35:17,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 46978 states and 65302 transitions. [2025-02-05 16:35:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:17,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:17,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:17,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:35:17,649 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:17,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash 993648459, now seen corresponding path program 1 times [2025-02-05 16:35:17,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:17,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755746936] [2025-02-05 16:35:17,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:17,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:17,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:17,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:17,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:17,739 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:35:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755746936] [2025-02-05 16:35:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755746936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:17,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:17,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379537744] [2025-02-05 16:35:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:17,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:17,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:17,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:17,741 INFO L87 Difference]: Start difference. First operand 46978 states and 65302 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:18,313 INFO L93 Difference]: Finished difference Result 139106 states and 191603 transitions. [2025-02-05 16:35:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:18,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:35:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:18,643 INFO L225 Difference]: With dead ends: 139106 [2025-02-05 16:35:18,643 INFO L226 Difference]: Without dead ends: 121823 [2025-02-05 16:35:18,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:18,688 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1614 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:18,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 454 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121823 states. [2025-02-05 16:35:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121823 to 47174. [2025-02-05 16:35:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47174 states, 47173 states have (on average 1.3896508596018908) internal successors, (65554), 47173 states have internal predecessors, (65554), 0 states have call successors, (0), 0 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:35:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47174 states to 47174 states and 65554 transitions. [2025-02-05 16:35:19,762 INFO L78 Accepts]: Start accepts. Automaton has 47174 states and 65554 transitions. Word has length 75 [2025-02-05 16:35:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:19,764 INFO L471 AbstractCegarLoop]: Abstraction has 47174 states and 65554 transitions. [2025-02-05 16:35:19,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 47174 states and 65554 transitions. [2025-02-05 16:35:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:19,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:19,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:35:19,771 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 92701932, now seen corresponding path program 1 times [2025-02-05 16:35:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788343647] [2025-02-05 16:35:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:19,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:19,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:19,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:19,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:19,988 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:35:19,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788343647] [2025-02-05 16:35:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788343647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:19,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:19,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374099342] [2025-02-05 16:35:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:19,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:19,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:19,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:19,990 INFO L87 Difference]: Start difference. First operand 47174 states and 65554 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:20,599 INFO L93 Difference]: Finished difference Result 148799 states and 205992 transitions. [2025-02-05 16:35:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:20,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:35:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:20,793 INFO L225 Difference]: With dead ends: 148799 [2025-02-05 16:35:20,793 INFO L226 Difference]: Without dead ends: 125984 [2025-02-05 16:35:20,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:20,843 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1767 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:20,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 468 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125984 states. [2025-02-05 16:35:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125984 to 47290. [2025-02-05 16:35:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47290 states, 47289 states have (on average 1.3892660026644674) internal successors, (65697), 47289 states have internal predecessors, (65697), 0 states have call successors, (0), 0 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:35:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47290 states to 47290 states and 65697 transitions. [2025-02-05 16:35:21,943 INFO L78 Accepts]: Start accepts. Automaton has 47290 states and 65697 transitions. Word has length 75 [2025-02-05 16:35:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:21,943 INFO L471 AbstractCegarLoop]: Abstraction has 47290 states and 65697 transitions. [2025-02-05 16:35:21,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 47290 states and 65697 transitions. [2025-02-05 16:35:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:21,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:21,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:21,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:35:21,951 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:21,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1428162901, now seen corresponding path program 1 times [2025-02-05 16:35:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:21,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321095713] [2025-02-05 16:35:21,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:21,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:21,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:21,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:21,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:22,087 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:35:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321095713] [2025-02-05 16:35:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321095713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667862075] [2025-02-05 16:35:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:22,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:22,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:22,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:22,089 INFO L87 Difference]: Start difference. First operand 47290 states and 65697 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:22,732 INFO L93 Difference]: Finished difference Result 112040 states and 153709 transitions. [2025-02-05 16:35:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:22,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:35:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:22,902 INFO L225 Difference]: With dead ends: 112040 [2025-02-05 16:35:22,902 INFO L226 Difference]: Without dead ends: 103129 [2025-02-05 16:35:22,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:22,941 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1436 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:22,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 445 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103129 states. [2025-02-05 16:35:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103129 to 47672. [2025-02-05 16:35:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47672 states, 47671 states have (on average 1.3879717228503703) internal successors, (66166), 47671 states have internal predecessors, (66166), 0 states have call successors, (0), 0 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:35:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 66166 transitions. [2025-02-05 16:35:24,075 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 66166 transitions. Word has length 75 [2025-02-05 16:35:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:24,075 INFO L471 AbstractCegarLoop]: Abstraction has 47672 states and 66166 transitions. [2025-02-05 16:35:24,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:24,075 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 66166 transitions. [2025-02-05 16:35:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:24,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:24,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] [2025-02-05 16:35:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:35:24,081 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:24,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -113043957, now seen corresponding path program 1 times [2025-02-05 16:35:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579481933] [2025-02-05 16:35:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:24,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:24,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:24,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:24,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:24,169 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:35:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579481933] [2025-02-05 16:35:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579481933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:24,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278196277] [2025-02-05 16:35:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:24,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:24,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:24,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:24,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:24,171 INFO L87 Difference]: Start difference. First operand 47672 states and 66166 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:24,600 INFO L93 Difference]: Finished difference Result 118388 states and 162730 transitions. [2025-02-05 16:35:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:35:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:24,702 INFO L225 Difference]: With dead ends: 118388 [2025-02-05 16:35:24,702 INFO L226 Difference]: Without dead ends: 90795 [2025-02-05 16:35:24,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:24,741 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1226 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:24,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 401 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90795 states. [2025-02-05 16:35:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90795 to 47722. [2025-02-05 16:35:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47722 states, 47721 states have (on average 1.3877747742084199) internal successors, (66226), 47721 states have internal predecessors, (66226), 0 states have call successors, (0), 0 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:35:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47722 states to 47722 states and 66226 transitions. [2025-02-05 16:35:25,656 INFO L78 Accepts]: Start accepts. Automaton has 47722 states and 66226 transitions. Word has length 75 [2025-02-05 16:35:25,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:25,657 INFO L471 AbstractCegarLoop]: Abstraction has 47722 states and 66226 transitions. [2025-02-05 16:35:25,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47722 states and 66226 transitions. [2025-02-05 16:35:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:25,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:25,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:25,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:35:25,666 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:25,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 965654185, now seen corresponding path program 1 times [2025-02-05 16:35:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:25,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011119257] [2025-02-05 16:35:25,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:25,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:25,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:25,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:25,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:25,937 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:35:25,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:25,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011119257] [2025-02-05 16:35:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011119257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:25,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273910989] [2025-02-05 16:35:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:25,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:25,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:25,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:25,939 INFO L87 Difference]: Start difference. First operand 47722 states and 66226 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:26,541 INFO L93 Difference]: Finished difference Result 82379 states and 113806 transitions. [2025-02-05 16:35:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:35:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:26,624 INFO L225 Difference]: With dead ends: 82379 [2025-02-05 16:35:26,624 INFO L226 Difference]: Without dead ends: 69746 [2025-02-05 16:35:26,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:35:26,651 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1343 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:26,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 744 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69746 states. [2025-02-05 16:35:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69746 to 47429. [2025-02-05 16:35:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47429 states, 47428 states have (on average 1.3875769587585394) internal successors, (65810), 47428 states have internal predecessors, (65810), 0 states have call successors, (0), 0 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:35:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47429 states to 47429 states and 65810 transitions. [2025-02-05 16:35:27,368 INFO L78 Accepts]: Start accepts. Automaton has 47429 states and 65810 transitions. Word has length 77 [2025-02-05 16:35:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:27,368 INFO L471 AbstractCegarLoop]: Abstraction has 47429 states and 65810 transitions. [2025-02-05 16:35:27,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 47429 states and 65810 transitions. [2025-02-05 16:35:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:27,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:27,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:27,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:35:27,375 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash -563846519, now seen corresponding path program 1 times [2025-02-05 16:35:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:27,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640153552] [2025-02-05 16:35:27,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:27,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:27,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:27,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:27,548 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:35:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640153552] [2025-02-05 16:35:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640153552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:27,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:27,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312950434] [2025-02-05 16:35:27,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:27,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:27,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:27,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:27,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:27,550 INFO L87 Difference]: Start difference. First operand 47429 states and 65810 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:28,403 INFO L93 Difference]: Finished difference Result 123473 states and 170987 transitions. [2025-02-05 16:35:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:28,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:35:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:28,527 INFO L225 Difference]: With dead ends: 123473 [2025-02-05 16:35:28,527 INFO L226 Difference]: Without dead ends: 77562 [2025-02-05 16:35:28,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:35:28,570 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 665 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:28,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 897 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77562 states. [2025-02-05 16:35:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77562 to 47065. [2025-02-05 16:35:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47065 states, 47064 states have (on average 1.387302396736359) internal successors, (65292), 47064 states have internal predecessors, (65292), 0 states have call successors, (0), 0 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:35:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47065 states to 47065 states and 65292 transitions. [2025-02-05 16:35:29,332 INFO L78 Accepts]: Start accepts. Automaton has 47065 states and 65292 transitions. Word has length 77 [2025-02-05 16:35:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:29,332 INFO L471 AbstractCegarLoop]: Abstraction has 47065 states and 65292 transitions. [2025-02-05 16:35:29,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 47065 states and 65292 transitions. [2025-02-05 16:35:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:29,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:29,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:29,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:35:29,338 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:29,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1872726423, now seen corresponding path program 1 times [2025-02-05 16:35:29,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:29,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916286376] [2025-02-05 16:35:29,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:29,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:29,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:29,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:29,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:29,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:29,614 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:35:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916286376] [2025-02-05 16:35:29,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916286376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:29,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:29,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:29,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597284408] [2025-02-05 16:35:29,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:29,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:29,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:29,615 INFO L87 Difference]: Start difference. First operand 47065 states and 65292 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:30,622 INFO L93 Difference]: Finished difference Result 119232 states and 165211 transitions. [2025-02-05 16:35:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:30,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:35:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:30,740 INFO L225 Difference]: With dead ends: 119232 [2025-02-05 16:35:30,740 INFO L226 Difference]: Without dead ends: 77631 [2025-02-05 16:35:30,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:35:30,767 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1391 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:30,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 870 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:35:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77631 states. [2025-02-05 16:35:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77631 to 46960. [2025-02-05 16:35:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46960 states, 46959 states have (on average 1.3866351498115377) internal successors, (65115), 46959 states have internal predecessors, (65115), 0 states have call successors, (0), 0 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:35:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46960 states to 46960 states and 65115 transitions. [2025-02-05 16:35:31,557 INFO L78 Accepts]: Start accepts. Automaton has 46960 states and 65115 transitions. Word has length 77 [2025-02-05 16:35:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:31,557 INFO L471 AbstractCegarLoop]: Abstraction has 46960 states and 65115 transitions. [2025-02-05 16:35:31,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 46960 states and 65115 transitions. [2025-02-05 16:35:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:31,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:31,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:31,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:35:31,567 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 873331243, now seen corresponding path program 1 times [2025-02-05 16:35:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:31,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889691084] [2025-02-05 16:35:31,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:31,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:31,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:31,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:31,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:31,892 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:35:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889691084] [2025-02-05 16:35:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889691084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216307314] [2025-02-05 16:35:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:31,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:31,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:31,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:31,894 INFO L87 Difference]: Start difference. First operand 46960 states and 65115 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:32,547 INFO L93 Difference]: Finished difference Result 100341 states and 139071 transitions. [2025-02-05 16:35:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:32,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:35:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:32,644 INFO L225 Difference]: With dead ends: 100341 [2025-02-05 16:35:32,644 INFO L226 Difference]: Without dead ends: 70616 [2025-02-05 16:35:32,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:35:32,678 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1434 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:32,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 844 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70616 states. [2025-02-05 16:35:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70616 to 46925. [2025-02-05 16:35:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46925 states, 46924 states have (on average 1.3856022504475323) internal successors, (65018), 46924 states have internal predecessors, (65018), 0 states have call successors, (0), 0 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:35:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46925 states to 46925 states and 65018 transitions. [2025-02-05 16:35:33,396 INFO L78 Accepts]: Start accepts. Automaton has 46925 states and 65018 transitions. Word has length 77 [2025-02-05 16:35:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:33,397 INFO L471 AbstractCegarLoop]: Abstraction has 46925 states and 65018 transitions. [2025-02-05 16:35:33,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 46925 states and 65018 transitions. [2025-02-05 16:35:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:35:33,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:33,402 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:35:33,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:35:33,402 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:33,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1541639458, now seen corresponding path program 1 times [2025-02-05 16:35:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618927746] [2025-02-05 16:35:33,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:33,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:35:33,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:35:33,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:33,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:33,850 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:35:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:33,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618927746] [2025-02-05 16:35:33,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618927746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:33,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:33,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:35:33,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354890719] [2025-02-05 16:35:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:33,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:35:33,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:33,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:35:33,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:33,852 INFO L87 Difference]: Start difference. First operand 46925 states and 65018 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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:35:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:34,641 INFO L93 Difference]: Finished difference Result 101970 states and 141427 transitions. [2025-02-05 16:35:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:35:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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:35:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:34,754 INFO L225 Difference]: With dead ends: 101970 [2025-02-05 16:35:34,754 INFO L226 Difference]: Without dead ends: 88644 [2025-02-05 16:35:34,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:35:34,786 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1742 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:34,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1828 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88644 states. [2025-02-05 16:35:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88644 to 46894. [2025-02-05 16:35:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46894 states, 46893 states have (on average 1.3856439127375089) internal successors, (64977), 46893 states have internal predecessors, (64977), 0 states have call successors, (0), 0 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:35:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46894 states to 46894 states and 64977 transitions. [2025-02-05 16:35:35,634 INFO L78 Accepts]: Start accepts. Automaton has 46894 states and 64977 transitions. Word has length 78 [2025-02-05 16:35:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:35,634 INFO L471 AbstractCegarLoop]: Abstraction has 46894 states and 64977 transitions. [2025-02-05 16:35:35,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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:35:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 46894 states and 64977 transitions. [2025-02-05 16:35:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:35:35,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:35,637 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:35:35,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:35:35,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:35,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash -408550813, now seen corresponding path program 1 times [2025-02-05 16:35:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702391380] [2025-02-05 16:35:35,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:35,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:35:35,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:35:35,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:35,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:36,105 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:35:36,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:36,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702391380] [2025-02-05 16:35:36,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702391380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:36,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:36,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:35:36,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398033476] [2025-02-05 16:35:36,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:36,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:35:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:36,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:35:36,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:36,107 INFO L87 Difference]: Start difference. First operand 46894 states and 64977 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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:35:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:37,011 INFO L93 Difference]: Finished difference Result 132361 states and 183033 transitions. [2025-02-05 16:35:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:35:37,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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:35:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:37,417 INFO L225 Difference]: With dead ends: 132361 [2025-02-05 16:35:37,418 INFO L226 Difference]: Without dead ends: 127153 [2025-02-05 16:35:37,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:35:37,459 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1761 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:37,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 2233 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127153 states. [2025-02-05 16:35:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127153 to 46200. [2025-02-05 16:35:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46200 states, 46199 states have (on average 1.386155544492305) internal successors, (64039), 46199 states have internal predecessors, (64039), 0 states have call successors, (0), 0 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:35:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46200 states to 46200 states and 64039 transitions. [2025-02-05 16:35:38,783 INFO L78 Accepts]: Start accepts. Automaton has 46200 states and 64039 transitions. Word has length 78 [2025-02-05 16:35:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:38,784 INFO L471 AbstractCegarLoop]: Abstraction has 46200 states and 64039 transitions. [2025-02-05 16:35:38,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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:35:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 46200 states and 64039 transitions. [2025-02-05 16:35:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:35:38,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:38,787 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:35:38,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:35:38,788 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:38,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash -248041127, now seen corresponding path program 1 times [2025-02-05 16:35:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092363255] [2025-02-05 16:35:38,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:38,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:35:38,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:35:38,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:38,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:38,848 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:35:38,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:38,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092363255] [2025-02-05 16:35:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092363255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:38,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:38,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675378029] [2025-02-05 16:35:38,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:38,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:38,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:38,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:38,849 INFO L87 Difference]: Start difference. First operand 46200 states and 64039 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:35:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:39,083 INFO L93 Difference]: Finished difference Result 102903 states and 142742 transitions. [2025-02-05 16:35:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:39,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:35:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:39,177 INFO L225 Difference]: With dead ends: 102903 [2025-02-05 16:35:39,178 INFO L226 Difference]: Without dead ends: 73481 [2025-02-05 16:35:39,212 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:35:39,212 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 194 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:39,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 372 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73481 states. [2025-02-05 16:35:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73481 to 73214. [2025-02-05 16:35:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73214 states, 73213 states have (on average 1.3888243891112235) internal successors, (101680), 73213 states have internal predecessors, (101680), 0 states have call successors, (0), 0 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:35:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73214 states to 73214 states and 101680 transitions. [2025-02-05 16:35:40,034 INFO L78 Accepts]: Start accepts. Automaton has 73214 states and 101680 transitions. Word has length 79 [2025-02-05 16:35:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:40,035 INFO L471 AbstractCegarLoop]: Abstraction has 73214 states and 101680 transitions. [2025-02-05 16:35:40,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:35:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 73214 states and 101680 transitions. [2025-02-05 16:35:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:35:40,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:40,038 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:35:40,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:35:40,038 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1173505979, now seen corresponding path program 1 times [2025-02-05 16:35:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029672421] [2025-02-05 16:35:40,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:40,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:35:40,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:35:40,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:40,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:40,076 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:35:40,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:40,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029672421] [2025-02-05 16:35:40,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029672421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:40,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:40,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:40,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992508765] [2025-02-05 16:35:40,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:40,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:40,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:40,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:40,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:40,078 INFO L87 Difference]: Start difference. First operand 73214 states and 101680 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:35:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:40,431 INFO L93 Difference]: Finished difference Result 149108 states and 207123 transitions. [2025-02-05 16:35:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:40,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:35:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:40,559 INFO L225 Difference]: With dead ends: 149108 [2025-02-05 16:35:40,559 INFO L226 Difference]: Without dead ends: 100415 [2025-02-05 16:35:40,607 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:35:40,607 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 176 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:40,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 359 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100415 states. [2025-02-05 16:35:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100415 to 66756. [2025-02-05 16:35:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66756 states, 66755 states have (on average 1.3889296681896488) internal successors, (92718), 66755 states have internal predecessors, (92718), 0 states have call successors, (0), 0 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:35:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66756 states to 66756 states and 92718 transitions. [2025-02-05 16:35:41,721 INFO L78 Accepts]: Start accepts. Automaton has 66756 states and 92718 transitions. Word has length 79 [2025-02-05 16:35:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:41,721 INFO L471 AbstractCegarLoop]: Abstraction has 66756 states and 92718 transitions. [2025-02-05 16:35:41,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:35:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 66756 states and 92718 transitions. [2025-02-05 16:35:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:35:41,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:41,725 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:35:41,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:35:41,725 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2059735434, now seen corresponding path program 1 times [2025-02-05 16:35:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195040005] [2025-02-05 16:35:41,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:41,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:35:41,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:35:41,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:41,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:41,769 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:35:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195040005] [2025-02-05 16:35:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195040005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494886871] [2025-02-05 16:35:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:41,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:41,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:41,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:41,771 INFO L87 Difference]: Start difference. First operand 66756 states and 92718 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:35:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:42,456 INFO L93 Difference]: Finished difference Result 103696 states and 143773 transitions. [2025-02-05 16:35:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:35:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:42,525 INFO L225 Difference]: With dead ends: 103696 [2025-02-05 16:35:42,525 INFO L226 Difference]: Without dead ends: 61456 [2025-02-05 16:35:42,544 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:35:42,545 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 158 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:42,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 598 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61456 states. [2025-02-05 16:35:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61456 to 61454. [2025-02-05 16:35:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61454 states, 61453 states have (on average 1.3758644817990986) internal successors, (84551), 61453 states have internal predecessors, (84551), 0 states have call successors, (0), 0 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:35:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61454 states to 61454 states and 84551 transitions. [2025-02-05 16:35:43,272 INFO L78 Accepts]: Start accepts. Automaton has 61454 states and 84551 transitions. Word has length 81 [2025-02-05 16:35:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:43,273 INFO L471 AbstractCegarLoop]: Abstraction has 61454 states and 84551 transitions. [2025-02-05 16:35:43,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:35:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 61454 states and 84551 transitions. [2025-02-05 16:35:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:35:43,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:43,277 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:35:43,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:35:43,278 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:43,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1743003449, now seen corresponding path program 1 times [2025-02-05 16:35:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:43,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009943575] [2025-02-05 16:35:43,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:43,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:35:43,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:35:43,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:43,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:43,313 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:35:43,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:43,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009943575] [2025-02-05 16:35:43,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009943575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:43,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:43,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:43,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377053736] [2025-02-05 16:35:43,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:43,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:43,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:43,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:43,315 INFO L87 Difference]: Start difference. First operand 61454 states and 84551 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:43,850 INFO L93 Difference]: Finished difference Result 115541 states and 159459 transitions. [2025-02-05 16:35:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:43,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:35:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:43,932 INFO L225 Difference]: With dead ends: 115541 [2025-02-05 16:35:43,932 INFO L226 Difference]: Without dead ends: 78257 [2025-02-05 16:35:43,953 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:35:43,955 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 188 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:43,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 429 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78257 states. [2025-02-05 16:35:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78257 to 59707. [2025-02-05 16:35:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59707 states, 59706 states have (on average 1.3735805446688776) internal successors, (82011), 59706 states have internal predecessors, (82011), 0 states have call successors, (0), 0 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:35:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59707 states to 59707 states and 82011 transitions. [2025-02-05 16:35:44,520 INFO L78 Accepts]: Start accepts. Automaton has 59707 states and 82011 transitions. Word has length 82 [2025-02-05 16:35:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:44,521 INFO L471 AbstractCegarLoop]: Abstraction has 59707 states and 82011 transitions. [2025-02-05 16:35:44,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 59707 states and 82011 transitions. [2025-02-05 16:35:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:35:44,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:44,524 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:35:44,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:35:44,525 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:44,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:44,525 INFO L85 PathProgramCache]: Analyzing trace with hash -383234370, now seen corresponding path program 1 times [2025-02-05 16:35:44,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:44,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474094539] [2025-02-05 16:35:44,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:44,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:44,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:35:44,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:35:44,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:44,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:44,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474094539] [2025-02-05 16:35:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474094539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847747605] [2025-02-05 16:35:44,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:44,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:44,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:44,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:44,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:44,557 INFO L87 Difference]: Start difference. First operand 59707 states and 82011 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:44,884 INFO L93 Difference]: Finished difference Result 76505 states and 104812 transitions. [2025-02-05 16:35:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:35:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:44,940 INFO L225 Difference]: With dead ends: 76505 [2025-02-05 16:35:44,941 INFO L226 Difference]: Without dead ends: 52583 [2025-02-05 16:35:44,961 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:35:44,961 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 139 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:44,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 550 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52583 states. [2025-02-05 16:35:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52583 to 52581. [2025-02-05 16:35:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52581 states, 52580 states have (on average 1.3596614682388741) internal successors, (71491), 52580 states have internal predecessors, (71491), 0 states have call successors, (0), 0 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:35:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52581 states to 52581 states and 71491 transitions. [2025-02-05 16:35:45,426 INFO L78 Accepts]: Start accepts. Automaton has 52581 states and 71491 transitions. Word has length 82 [2025-02-05 16:35:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:45,426 INFO L471 AbstractCegarLoop]: Abstraction has 52581 states and 71491 transitions. [2025-02-05 16:35:45,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 52581 states and 71491 transitions. [2025-02-05 16:35:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:35:45,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:45,432 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:35:45,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:35:45,433 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:45,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:45,433 INFO L85 PathProgramCache]: Analyzing trace with hash 965271617, now seen corresponding path program 1 times [2025-02-05 16:35:45,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:45,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862404475] [2025-02-05 16:35:45,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:45,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:35:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:35:45,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:45,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:45,496 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:35:45,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:45,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862404475] [2025-02-05 16:35:45,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862404475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:45,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125991602] [2025-02-05 16:35:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:45,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:45,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:45,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:45,499 INFO L87 Difference]: Start difference. First operand 52581 states and 71491 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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:35:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:46,044 INFO L93 Difference]: Finished difference Result 103718 states and 141174 transitions. [2025-02-05 16:35:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:46,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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:35:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:46,126 INFO L225 Difference]: With dead ends: 103718 [2025-02-05 16:35:46,126 INFO L226 Difference]: Without dead ends: 72816 [2025-02-05 16:35:46,176 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:35:46,178 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 173 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:46,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 358 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72816 states. [2025-02-05 16:35:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72816 to 51445. [2025-02-05 16:35:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51445 states, 51444 states have (on average 1.3575344063447632) internal successors, (69837), 51444 states have internal predecessors, (69837), 0 states have call successors, (0), 0 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:35:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51445 states to 51445 states and 69837 transitions. [2025-02-05 16:35:46,736 INFO L78 Accepts]: Start accepts. Automaton has 51445 states and 69837 transitions. Word has length 83 [2025-02-05 16:35:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:46,736 INFO L471 AbstractCegarLoop]: Abstraction has 51445 states and 69837 transitions. [2025-02-05 16:35:46,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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:35:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 51445 states and 69837 transitions. [2025-02-05 16:35:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:35:46,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:46,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:46,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:35:46,743 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash -764699832, now seen corresponding path program 1 times [2025-02-05 16:35:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923043660] [2025-02-05 16:35:46,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:46,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:35:46,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:35:46,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:46,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:47,525 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:35:47,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923043660] [2025-02-05 16:35:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923043660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:47,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:35:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408287551] [2025-02-05 16:35:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:47,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:35:47,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:47,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:35:47,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:47,527 INFO L87 Difference]: Start difference. First operand 51445 states and 69837 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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:35:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:48,225 INFO L93 Difference]: Finished difference Result 84937 states and 115372 transitions. [2025-02-05 16:35:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:35:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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:35:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:48,323 INFO L225 Difference]: With dead ends: 84937 [2025-02-05 16:35:48,323 INFO L226 Difference]: Without dead ends: 76054 [2025-02-05 16:35:48,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:35:48,354 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1093 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:48,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 2624 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76054 states. [2025-02-05 16:35:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76054 to 51399. [2025-02-05 16:35:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51399 states, 51398 states have (on average 1.3576598311218335) internal successors, (69781), 51398 states have internal predecessors, (69781), 0 states have call successors, (0), 0 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:35:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51399 states to 51399 states and 69781 transitions. [2025-02-05 16:35:49,255 INFO L78 Accepts]: Start accepts. Automaton has 51399 states and 69781 transitions. Word has length 83 [2025-02-05 16:35:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:49,255 INFO L471 AbstractCegarLoop]: Abstraction has 51399 states and 69781 transitions. [2025-02-05 16:35:49,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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:35:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 51399 states and 69781 transitions. [2025-02-05 16:35:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:35:49,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:49,263 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] [2025-02-05 16:35:49,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:35:49,264 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:49,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1952074962, now seen corresponding path program 1 times [2025-02-05 16:35:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:49,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970496600] [2025-02-05 16:35:49,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:49,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:35:49,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:35:49,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:49,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:49,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:49,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970496600] [2025-02-05 16:35:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970496600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:49,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:49,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:49,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886745400] [2025-02-05 16:35:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:49,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:49,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:49,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:49,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:49,322 INFO L87 Difference]: Start difference. First operand 51399 states and 69781 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:35:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:49,520 INFO L93 Difference]: Finished difference Result 107833 states and 147225 transitions. [2025-02-05 16:35:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:49,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-02-05 16:35:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:49,613 INFO L225 Difference]: With dead ends: 107833 [2025-02-05 16:35:49,613 INFO L226 Difference]: Without dead ends: 78896 [2025-02-05 16:35:49,650 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:35:49,651 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 498 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:35:49,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 498 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78896 states. [2025-02-05 16:35:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78896 to 75544. [2025-02-05 16:35:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75544 states, 75543 states have (on average 1.3575844221172049) internal successors, (102556), 75543 states have internal predecessors, (102556), 0 states have call successors, (0), 0 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:35:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75544 states to 75544 states and 102556 transitions. [2025-02-05 16:35:50,496 INFO L78 Accepts]: Start accepts. Automaton has 75544 states and 102556 transitions. Word has length 92 [2025-02-05 16:35:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:50,497 INFO L471 AbstractCegarLoop]: Abstraction has 75544 states and 102556 transitions. [2025-02-05 16:35:50,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:35:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 75544 states and 102556 transitions. [2025-02-05 16:35:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:35:50,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:50,504 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] [2025-02-05 16:35:50,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:35:50,504 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash -226819689, now seen corresponding path program 1 times [2025-02-05 16:35:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657670386] [2025-02-05 16:35:50,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:50,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:35:50,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:35:50,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:50,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:50,580 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:35:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:50,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657670386] [2025-02-05 16:35:50,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657670386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:50,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520360538] [2025-02-05 16:35:50,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:50,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:50,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:50,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:50,581 INFO L87 Difference]: Start difference. First operand 75544 states and 102556 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:51,203 INFO L93 Difference]: Finished difference Result 223177 states and 304063 transitions. [2025-02-05 16:35:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:35:51,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-05 16:35:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:51,438 INFO L225 Difference]: With dead ends: 223177 [2025-02-05 16:35:51,439 INFO L226 Difference]: Without dead ends: 192462 [2025-02-05 16:35:51,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:51,508 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1481 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:51,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 430 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192462 states. [2025-02-05 16:35:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192462 to 107519. [2025-02-05 16:35:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107519 states, 107518 states have (on average 1.3594560910731226) internal successors, (146166), 107518 states have internal predecessors, (146166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)