./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-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.3.1.ufo.UNBOUNDED.pals.c.v+sep-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 c9fed3b6ecd1551705440e8c2971862b3f83812db515b8181a20d7126e9055f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:31:34,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:31:34,799 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:31:34,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:31:34,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:31:34,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:31:34,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:31:34,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:31:34,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:31:34,840 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:31:34,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:31:34,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:31:34,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:31:34,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:31:34,841 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:31:34,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:31:34,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:31:34,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:31:34,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:31:34,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:31:34,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:31:34,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:31:34,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:31:34,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:31:34,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:34,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:31:34,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:31:34,845 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 -> c9fed3b6ecd1551705440e8c2971862b3f83812db515b8181a20d7126e9055f8 [2025-02-05 16:31:35,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:31:35,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:31:35,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:31:35,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:31:35,182 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:31:35,183 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:31:36,527 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b7aac6d2/e335748bd15f497e82169a5878707b40/FLAGec2b4298f [2025-02-05 16:31:36,981 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:31:36,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:31:37,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b7aac6d2/e335748bd15f497e82169a5878707b40/FLAGec2b4298f [2025-02-05 16:31:37,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b7aac6d2/e335748bd15f497e82169a5878707b40 [2025-02-05 16:31:37,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:31:37,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:31:37,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:37,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:31:37,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:31:37,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:37" (1/1) ... [2025-02-05 16:31:37,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f833fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:37, skipping insertion in model container [2025-02-05 16:31:37,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:37" (1/1) ... [2025-02-05 16:31:37,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:31:37,474 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[7186,7199] [2025-02-05 16:31:37,511 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11327,11340] [2025-02-05 16:31:37,558 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[18377,18390] [2025-02-05 16:31:37,584 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[24849,24862] [2025-02-05 16:31:37,666 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[43924,43937] [2025-02-05 16:31:37,774 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71846,71859] [2025-02-05 16:31:37,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:37,961 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:31:38,002 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[7186,7199] [2025-02-05 16:31:38,011 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11327,11340] [2025-02-05 16:31:38,033 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[18377,18390] [2025-02-05 16:31:38,049 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[24849,24862] [2025-02-05 16:31:38,084 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[43924,43937] [2025-02-05 16:31:38,138 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71846,71859] [2025-02-05 16:31:38,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:38,277 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:31:38,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38 WrapperNode [2025-02-05 16:31:38,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:38,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:38,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:31:38,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:31:38,288 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:31:38" (1/1) ... [2025-02-05 16:31:38,345 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:31:38" (1/1) ... [2025-02-05 16:31:38,505 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6061 [2025-02-05 16:31:38,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:38,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:31:38,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:31:38,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:31:38,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,611 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:31:38,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:31:38,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:31:38,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:31:38,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:31:38,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (1/1) ... [2025-02-05 16:31:38,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:38,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:38,772 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:31:38,776 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:31:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:31:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:31:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:31:38,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:31:39,066 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:31:39,068 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:31:42,367 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4862: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:42,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6053: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-02-05 16:31:42,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3675: havoc main_~node1__m1~22#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~25#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~24#1; [2025-02-05 16:31:42,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4733: havoc main_~check__tmp~32#1; [2025-02-05 16:31:42,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: havoc main_~node3__m3~0#1; [2025-02-05 16:31:42,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9227: havoc main_~node3__m3~39#1;havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-02-05 16:31:42,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6849: havoc main_~node1__m1~41#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-02-05 16:31:42,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7644: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-02-05 16:31:42,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9098: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-02-05 16:31:42,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8704: havoc main_~node2____CPAchecker_TMP_1~8#1; [2025-02-05 16:31:42,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8837: havoc main_~node1__m1~54#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~59#1;havoc main_~node3____CPAchecker_TMP_1~10#1; [2025-02-05 16:31:42,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4611: havoc main_~node1__m1~28#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~31#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~30#1; [2025-02-05 16:31:42,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L251: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:42,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9237: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6859: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7784: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6596: havoc main_~node1__m1~39#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5407: havoc main_~node1__m1~32#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3955: havoc main_~node3__m3~15#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~26#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6466: havoc main_~node3__m3~28#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2239: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2770: havoc main_~node3__m3~11#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2111: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10040: havoc main_~node2__m2~50#1;havoc main_~node1____CPAchecker_TMP_1~18#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~69#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~68#1; [2025-02-05 16:31:42,370 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7398: havoc main_~node1__m1~45#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L924: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6606: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5417: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8456: havoc main_~node1__m1~51#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6476: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7534: havoc main_~node2__m2~38#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8064: havoc main_~node1____CPAchecker_TMP_1~14#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-02-05 16:31:42,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1326: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3311: havoc main_~node2__m2~17#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4368: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4897: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7408: havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1198: havoc main_~node3__m3~5#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4105: havoc main_~node3__m3~16#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~27#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8336: havoc main_~node3__m3~35#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4771: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7810: havoc main_~node2__m2~40#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1601: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7151: havoc main_~node1__m1~43#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5170: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6888: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-02-05 16:31:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3321: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7418: havoc main_~node2__m2~37#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4644: havoc main_~node2__m2~24#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5967: havoc main_~node1__m1~35#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3458: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~23#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~22#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9272: havoc main_~node1__m1~57#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~62#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7687: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~39#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8216: havoc main_~node1__m1~49#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7820: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9803: havoc main_~node3__m3~42#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7161: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330: havoc main_~node3__m3~12#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6634: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5446: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-02-05 16:31:42,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10468: havoc main_~node2____CPAchecker_TMP_1~12#1;havoc main_~node2__m2~52#1;havoc main_~node1____CPAchecker_TMP_1~19#1;havoc main_~node1__m1~67#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~72#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~71#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3733: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7829: havoc main_~node3__m3~33#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8623: havoc main_~node1__m1~53#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~58#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~57#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9813: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4396: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3340: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6247: havoc main_~node3__m3~26#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9023: havoc main_~node2__m2~46#1;havoc main_~node1____CPAchecker_TMP_1~16#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~61#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~60#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4799: havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-02-05 16:31:42,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7839: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-02-05 16:31:42,375 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1629: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:42,375 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5198: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-02-05 16:31:42,375 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1102: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:31:42,375 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10087: havoc main_~node2____CPAchecker_TMP_0~9#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7581: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8639: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7189: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6397: havoc main_~node3__m3~27#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5473: havoc main_~node2__m2~27#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6931: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~34#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3761: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-02-05 16:31:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4686: havoc main_~node3__m3~20#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2708: havoc main_~node2__m2~12#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~17#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5483: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2313: havoc main_~node2__m2~9#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3239: havoc main_~node2__m2~16#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~21#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5750: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~33#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2447: havoc main_~node2__m2~10#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: havoc main_~node2__m2~13#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~18#1; [2025-02-05 16:31:42,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2580: havoc main_~node2__m2~11#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~16#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9848: havoc main_~node1__m1~62#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~67#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2978: havoc main_~node2__m2~14#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~19#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111: havoc main_~node2__m2~15#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~20#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5622: havoc main_~node3__m3~23#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10115: havoc main_~node2____CPAchecker_TMP_1~11#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4834: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8666: havoc main_~node2__m2~44#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7609: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-02-05 16:31:42,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7874: havoc main_~node1__m1~46#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6025: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9462: havoc main_~node1____CPAchecker_TMP_1~17#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~64#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~63#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4310: havoc main_~node1__m1~26#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~29#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~28#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5632: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4180: havoc main_~node3__m3~17#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9070: havoc main_~node2____CPAchecker_TMP_0~8#1; [2025-02-05 16:31:42,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8411: havoc main_~node3__m3~36#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8676: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9734: havoc main_~node3__m3~41#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~66#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc main_~node1__m1~8#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~node2__m2~0#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2073: havoc main_~node1__m1~11#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5112: havoc main_~node1__m1~30#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10266: havoc main_~node1__m1~65#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~70#1;havoc main_~node3____CPAchecker_TMP_1~12#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5511: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:42,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7493: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-02-05 16:31:42,381 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4190: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-02-05 16:31:42,381 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8421: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-02-05 16:31:42,381 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L232: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:42,381 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9614: havoc main_~node1__m1~60#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~65#1;havoc main_~node3____CPAchecker_TMP_1~11#1; [2025-02-05 16:31:42,381 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2083: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-02-05 16:31:42,637 INFO L? ?]: Removed 1041 outVars from TransFormulas that were not future-live. [2025-02-05 16:31:42,638 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:31:42,690 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:31:42,690 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:31:42,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:42 BoogieIcfgContainer [2025-02-05 16:31:42,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:31:42,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:31:42,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:31:42,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:31:42,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:31:37" (1/3) ... [2025-02-05 16:31:42,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b94295b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:42, skipping insertion in model container [2025-02-05 16:31:42,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:38" (2/3) ... [2025-02-05 16:31:42,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b94295b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:42, skipping insertion in model container [2025-02-05 16:31:42,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:42" (3/3) ... [2025-02-05 16:31:42,700 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:31:42,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:31:42,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 1254 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-02-05 16:31:42,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:31:42,839 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;@1ff37911, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:31:42,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-05 16:31:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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:31:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:31:42,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:42,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:42,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:42,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash 247370793, now seen corresponding path program 1 times [2025-02-05 16:31:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948855517] [2025-02-05 16:31:42,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:42,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:43,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:31:43,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:31:43,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:43,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:43,522 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:31:43,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:43,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948855517] [2025-02-05 16:31:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948855517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:43,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:43,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471305262] [2025-02-05 16:31:43,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:43,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:43,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:43,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:43,556 INFO L87 Difference]: Start difference. First operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 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 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:31:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:45,158 INFO L93 Difference]: Finished difference Result 2475 states and 4331 transitions. [2025-02-05 16:31:45,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:45,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-05 16:31:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:45,189 INFO L225 Difference]: With dead ends: 2475 [2025-02-05 16:31:45,189 INFO L226 Difference]: Without dead ends: 1558 [2025-02-05 16:31:45,196 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:31:45,199 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 7059 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7059 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:45,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7059 Valid, 1499 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:31:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-02-05 16:31:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1552. [2025-02-05 16:31:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1546 states have (on average 1.3544631306597672) internal successors, (2094), 1551 states have internal predecessors, (2094), 0 states have call successors, (0), 0 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:31:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2094 transitions. [2025-02-05 16:31:45,320 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2094 transitions. Word has length 51 [2025-02-05 16:31:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:45,320 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2094 transitions. [2025-02-05 16:31:45,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:31:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2094 transitions. [2025-02-05 16:31:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:31:45,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:45,326 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] [2025-02-05 16:31:45,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:31:45,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:45,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash -956613290, now seen corresponding path program 1 times [2025-02-05 16:31:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:45,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093030596] [2025-02-05 16:31:45,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:45,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:31:45,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:31:45,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:45,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:45,546 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:31:45,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093030596] [2025-02-05 16:31:45,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093030596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:45,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463785758] [2025-02-05 16:31:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:45,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:45,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:45,550 INFO L87 Difference]: Start difference. First operand 1552 states and 2094 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:31:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:46,585 INFO L93 Difference]: Finished difference Result 3079 states and 4232 transitions. [2025-02-05 16:31:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:31:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:46,594 INFO L225 Difference]: With dead ends: 3079 [2025-02-05 16:31:46,595 INFO L226 Difference]: Without dead ends: 1987 [2025-02-05 16:31:46,597 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:31:46,599 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 4621 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4621 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:46,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4621 Valid, 902 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:31:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-02-05 16:31:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1977. [2025-02-05 16:31:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1971 states have (on average 1.3678335870116691) internal successors, (2696), 1976 states have internal predecessors, (2696), 0 states have call successors, (0), 0 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:31:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2696 transitions. [2025-02-05 16:31:46,666 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2696 transitions. Word has length 52 [2025-02-05 16:31:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:46,666 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2696 transitions. [2025-02-05 16:31:46,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:31:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2696 transitions. [2025-02-05 16:31:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:31:46,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:46,674 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] [2025-02-05 16:31:46,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:31:46,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:46,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1530715901, now seen corresponding path program 1 times [2025-02-05 16:31:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:46,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373637815] [2025-02-05 16:31:46,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:46,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:31:46,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:31:46,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:46,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:46,876 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:31:46,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:46,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373637815] [2025-02-05 16:31:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373637815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:46,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:46,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644587622] [2025-02-05 16:31:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:46,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:46,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:46,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:46,881 INFO L87 Difference]: Start difference. First operand 1977 states and 2696 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:31:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:47,835 INFO L93 Difference]: Finished difference Result 4383 states and 6020 transitions. [2025-02-05 16:31:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:47,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:31:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:47,851 INFO L225 Difference]: With dead ends: 4383 [2025-02-05 16:31:47,852 INFO L226 Difference]: Without dead ends: 3053 [2025-02-05 16:31:47,855 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:31:47,857 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 4567 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:47,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 968 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:31:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-02-05 16:31:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3041. [2025-02-05 16:31:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3759472817133442) internal successors, (4176), 3040 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4176 transitions. [2025-02-05 16:31:47,953 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4176 transitions. Word has length 52 [2025-02-05 16:31:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:47,954 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4176 transitions. [2025-02-05 16:31:47,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:31:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4176 transitions. [2025-02-05 16:31:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:31:47,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:47,962 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] [2025-02-05 16:31:47,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:31:47,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:47,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash 569393369, now seen corresponding path program 1 times [2025-02-05 16:31:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251693449] [2025-02-05 16:31:47,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:47,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:31:48,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:31:48,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:48,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:48,447 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:31:48,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251693449] [2025-02-05 16:31:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251693449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:48,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:48,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:31:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82744774] [2025-02-05 16:31:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:31:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:48,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:31:48,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:31:48,449 INFO L87 Difference]: Start difference. First operand 3041 states and 4176 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:31:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:50,014 INFO L93 Difference]: Finished difference Result 4353 states and 6079 transitions. [2025-02-05 16:31:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:50,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:31:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:50,026 INFO L225 Difference]: With dead ends: 4353 [2025-02-05 16:31:50,027 INFO L226 Difference]: Without dead ends: 3682 [2025-02-05 16:31:50,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:31:50,031 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 5165 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5165 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:50,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5165 Valid, 2859 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:31:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2025-02-05 16:31:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 3041. [2025-02-05 16:31:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3756177924217463) internal successors, (4175), 3040 states have internal predecessors, (4175), 0 states have call successors, (0), 0 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:31:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4175 transitions. [2025-02-05 16:31:50,120 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4175 transitions. Word has length 53 [2025-02-05 16:31:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:50,121 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4175 transitions. [2025-02-05 16:31:50,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:31:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4175 transitions. [2025-02-05 16:31:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:31:50,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:50,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:50,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:31:50,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:50,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash 734562753, now seen corresponding path program 1 times [2025-02-05 16:31:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379754543] [2025-02-05 16:31:50,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:50,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:31:50,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:31:50,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:50,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:50,588 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:31:50,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379754543] [2025-02-05 16:31:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379754543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:50,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:50,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615025724] [2025-02-05 16:31:50,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:50,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:50,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:50,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:50,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:50,591 INFO L87 Difference]: Start difference. First operand 3041 states and 4175 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:31:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:52,716 INFO L93 Difference]: Finished difference Result 5150 states and 7205 transitions. [2025-02-05 16:31:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:31:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:31:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:52,730 INFO L225 Difference]: With dead ends: 5150 [2025-02-05 16:31:52,730 INFO L226 Difference]: Without dead ends: 4593 [2025-02-05 16:31:52,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:31:52,734 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 5147 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 3843 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5147 SdHoareTripleChecker+Valid, 3552 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:52,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5147 Valid, 3552 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3843 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:31:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2025-02-05 16:31:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 3041. [2025-02-05 16:31:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3752883031301482) internal successors, (4174), 3040 states have internal predecessors, (4174), 0 states have call successors, (0), 0 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:31:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4174 transitions. [2025-02-05 16:31:52,816 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4174 transitions. Word has length 53 [2025-02-05 16:31:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:52,816 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4174 transitions. [2025-02-05 16:31:52,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:31:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4174 transitions. [2025-02-05 16:31:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:31:52,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:52,820 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] [2025-02-05 16:31:52,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:31:52,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:52,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2071824519, now seen corresponding path program 1 times [2025-02-05 16:31:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:52,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812906890] [2025-02-05 16:31:52,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:52,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:31:52,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:31:52,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:52,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:53,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812906890] [2025-02-05 16:31:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812906890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:53,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090146347] [2025-02-05 16:31:53,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:53,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:53,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:53,158 INFO L87 Difference]: Start difference. First operand 3041 states and 4174 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:31:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:54,656 INFO L93 Difference]: Finished difference Result 3789 states and 5171 transitions. [2025-02-05 16:31:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:31:54,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:31:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:54,665 INFO L225 Difference]: With dead ends: 3789 [2025-02-05 16:31:54,665 INFO L226 Difference]: Without dead ends: 3784 [2025-02-05 16:31:54,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:54,667 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 6182 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6182 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:54,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6182 Valid, 2679 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:31:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2025-02-05 16:31:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3041. [2025-02-05 16:31:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3749588138385502) internal successors, (4173), 3040 states have internal predecessors, (4173), 0 states have call successors, (0), 0 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:31:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4173 transitions. [2025-02-05 16:31:54,745 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4173 transitions. Word has length 53 [2025-02-05 16:31:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:54,746 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4173 transitions. [2025-02-05 16:31:54,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:31:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4173 transitions. [2025-02-05 16:31:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:54,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:54,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:54,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:31:54,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:54,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1126934533, now seen corresponding path program 1 times [2025-02-05 16:31:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220978312] [2025-02-05 16:31:54,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:54,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:54,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:54,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:54,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:54,823 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:31:54,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220978312] [2025-02-05 16:31:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220978312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:54,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:54,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891164858] [2025-02-05 16:31:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:54,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:54,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:54,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:54,825 INFO L87 Difference]: Start difference. First operand 3041 states and 4173 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:31:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:54,947 INFO L93 Difference]: Finished difference Result 5690 states and 7956 transitions. [2025-02-05 16:31:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:54,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:31:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:54,959 INFO L225 Difference]: With dead ends: 5690 [2025-02-05 16:31:54,959 INFO L226 Difference]: Without dead ends: 4053 [2025-02-05 16:31:54,962 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:31:54,964 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 659 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:54,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2047 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states. [2025-02-05 16:31:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 4047. [2025-02-05 16:31:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4047 states, 4041 states have (on average 1.358574610244989) internal successors, (5490), 4046 states have internal predecessors, (5490), 0 states have call successors, (0), 0 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:31:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5490 transitions. [2025-02-05 16:31:55,052 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5490 transitions. Word has length 54 [2025-02-05 16:31:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:55,052 INFO L471 AbstractCegarLoop]: Abstraction has 4047 states and 5490 transitions. [2025-02-05 16:31:55,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:31:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5490 transitions. [2025-02-05 16:31:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:55,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:55,056 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] [2025-02-05 16:31:55,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:31:55,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:55,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash -696283544, now seen corresponding path program 1 times [2025-02-05 16:31:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:55,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490474248] [2025-02-05 16:31:55,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:55,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:55,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:55,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:55,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:55,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:55,134 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:31:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490474248] [2025-02-05 16:31:55,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490474248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:55,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:55,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165346264] [2025-02-05 16:31:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:55,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:55,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:55,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:55,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:55,136 INFO L87 Difference]: Start difference. First operand 4047 states and 5490 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:31:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:55,208 INFO L93 Difference]: Finished difference Result 5747 states and 8083 transitions. [2025-02-05 16:31:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:55,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:31:55,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:55,230 INFO L225 Difference]: With dead ends: 5747 [2025-02-05 16:31:55,230 INFO L226 Difference]: Without dead ends: 4398 [2025-02-05 16:31:55,237 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:31:55,238 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 563 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:55,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1736 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4398 states. [2025-02-05 16:31:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4398 to 4396. [2025-02-05 16:31:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4396 states, 4390 states have (on average 1.3776765375854214) internal successors, (6048), 4395 states have internal predecessors, (6048), 0 states have call successors, (0), 0 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:31:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4396 states to 4396 states and 6048 transitions. [2025-02-05 16:31:55,309 INFO L78 Accepts]: Start accepts. Automaton has 4396 states and 6048 transitions. Word has length 54 [2025-02-05 16:31:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:55,310 INFO L471 AbstractCegarLoop]: Abstraction has 4396 states and 6048 transitions. [2025-02-05 16:31:55,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:31:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4396 states and 6048 transitions. [2025-02-05 16:31:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:55,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:55,314 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] [2025-02-05 16:31:55,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:31:55,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:55,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash -43028613, now seen corresponding path program 1 times [2025-02-05 16:31:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:55,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206071112] [2025-02-05 16:31:55,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:55,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:55,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:55,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:55,389 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:31:55,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:55,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206071112] [2025-02-05 16:31:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206071112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058709329] [2025-02-05 16:31:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:55,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:55,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:55,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:55,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:55,392 INFO L87 Difference]: Start difference. First operand 4396 states and 6048 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:31:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:55,484 INFO L93 Difference]: Finished difference Result 7317 states and 10502 transitions. [2025-02-05 16:31:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:31:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:55,501 INFO L225 Difference]: With dead ends: 7317 [2025-02-05 16:31:55,501 INFO L226 Difference]: Without dead ends: 5345 [2025-02-05 16:31:55,505 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:31:55,506 INFO L435 NwaCegarLoop]: 1118 mSDtfsCounter, 560 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:55,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1694 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2025-02-05 16:31:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 5343. [2025-02-05 16:31:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5337 states have (on average 1.405283867341203) internal successors, (7500), 5342 states have internal predecessors, (7500), 0 states have call successors, (0), 0 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:31:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 7500 transitions. [2025-02-05 16:31:55,609 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 7500 transitions. Word has length 54 [2025-02-05 16:31:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:55,609 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 7500 transitions. [2025-02-05 16:31:55,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:31:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 7500 transitions. [2025-02-05 16:31:55,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:55,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:55,614 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] [2025-02-05 16:31:55,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:31:55,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:55,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash 744258676, now seen corresponding path program 1 times [2025-02-05 16:31:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:55,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965542364] [2025-02-05 16:31:55,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:55,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:55,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:55,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:55,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:55,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:55,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965542364] [2025-02-05 16:31:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965542364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:55,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084888654] [2025-02-05 16:31:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:55,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:55,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:55,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:55,686 INFO L87 Difference]: Start difference. First operand 5343 states and 7500 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:31:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:55,868 INFO L93 Difference]: Finished difference Result 10270 states and 14610 transitions. [2025-02-05 16:31:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:55,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:31:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:55,884 INFO L225 Difference]: With dead ends: 10270 [2025-02-05 16:31:55,884 INFO L226 Difference]: Without dead ends: 5434 [2025-02-05 16:31:55,889 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:31:55,890 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 755 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:55,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1473 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5434 states. [2025-02-05 16:31:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5434 to 4425. [2025-02-05 16:31:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 4419 states have (on average 1.4159312061552387) internal successors, (6257), 4424 states have internal predecessors, (6257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 6257 transitions. [2025-02-05 16:31:55,966 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 6257 transitions. Word has length 55 [2025-02-05 16:31:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:55,967 INFO L471 AbstractCegarLoop]: Abstraction has 4425 states and 6257 transitions. [2025-02-05 16:31:55,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:31:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 6257 transitions. [2025-02-05 16:31:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:55,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:55,970 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] [2025-02-05 16:31:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:31:55,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:55,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 337706900, now seen corresponding path program 1 times [2025-02-05 16:31:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502398541] [2025-02-05 16:31:55,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:55,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:55,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:55,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:55,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:56,022 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:31:56,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:56,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502398541] [2025-02-05 16:31:56,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502398541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:56,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:56,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414850857] [2025-02-05 16:31:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:56,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:56,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:56,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:56,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:56,023 INFO L87 Difference]: Start difference. First operand 4425 states and 6257 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:31:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:56,198 INFO L93 Difference]: Finished difference Result 8419 states and 12144 transitions. [2025-02-05 16:31:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:56,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:31:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:56,208 INFO L225 Difference]: With dead ends: 8419 [2025-02-05 16:31:56,208 INFO L226 Difference]: Without dead ends: 4753 [2025-02-05 16:31:56,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:31:56,213 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 745 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:56,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1101 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2025-02-05 16:31:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 3837. [2025-02-05 16:31:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3832 states have (on average 1.427713987473904) internal successors, (5471), 3836 states have internal predecessors, (5471), 0 states have call successors, (0), 0 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:31:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5471 transitions. [2025-02-05 16:31:56,267 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5471 transitions. Word has length 55 [2025-02-05 16:31:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:56,267 INFO L471 AbstractCegarLoop]: Abstraction has 3837 states and 5471 transitions. [2025-02-05 16:31:56,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:31:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5471 transitions. [2025-02-05 16:31:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:56,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:56,270 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] [2025-02-05 16:31:56,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:31:56,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:56,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1648708167, now seen corresponding path program 1 times [2025-02-05 16:31:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108625893] [2025-02-05 16:31:56,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:56,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:56,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:56,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:56,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:56,332 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:31:56,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:56,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108625893] [2025-02-05 16:31:56,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108625893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:56,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:56,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:56,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650301582] [2025-02-05 16:31:56,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:56,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:56,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:56,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:56,334 INFO L87 Difference]: Start difference. First operand 3837 states and 5471 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:31:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:56,417 INFO L93 Difference]: Finished difference Result 7554 states and 10966 transitions. [2025-02-05 16:31:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:31:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:56,429 INFO L225 Difference]: With dead ends: 7554 [2025-02-05 16:31:56,429 INFO L226 Difference]: Without dead ends: 4223 [2025-02-05 16:31:56,434 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:31:56,435 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 581 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:56,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 823 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2025-02-05 16:31:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 3399. [2025-02-05 16:31:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3395 states have (on average 1.4435935198821797) internal successors, (4901), 3398 states have internal predecessors, (4901), 0 states have call successors, (0), 0 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:31:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4901 transitions. [2025-02-05 16:31:56,484 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4901 transitions. Word has length 55 [2025-02-05 16:31:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:56,484 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 4901 transitions. [2025-02-05 16:31:56,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:31:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4901 transitions. [2025-02-05 16:31:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:31:56,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:56,486 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] [2025-02-05 16:31:56,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:31:56,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:56,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash -436326369, now seen corresponding path program 1 times [2025-02-05 16:31:56,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:56,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109357795] [2025-02-05 16:31:56,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:56,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:31:56,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:31:56,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:56,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:57,550 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:31:57,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:57,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109357795] [2025-02-05 16:31:57,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109357795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:57,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:57,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:31:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642654746] [2025-02-05 16:31:57,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:57,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:31:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:57,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:31:57,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:57,552 INFO L87 Difference]: Start difference. First operand 3399 states and 4901 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:31:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:59,870 INFO L93 Difference]: Finished difference Result 6500 states and 9412 transitions. [2025-02-05 16:31:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:31:59,871 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:31:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:59,885 INFO L225 Difference]: With dead ends: 6500 [2025-02-05 16:31:59,885 INFO L226 Difference]: Without dead ends: 6496 [2025-02-05 16:31:59,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 16:31:59,888 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 3842 mSDsluCounter, 5976 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3842 SdHoareTripleChecker+Valid, 6528 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:59,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3842 Valid, 6528 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:31:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2025-02-05 16:31:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 3399. [2025-02-05 16:31:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3395 states have (on average 1.443298969072165) internal successors, (4900), 3398 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:31:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4900 transitions. [2025-02-05 16:31:59,944 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4900 transitions. Word has length 56 [2025-02-05 16:31:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:59,945 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 4900 transitions. [2025-02-05 16:31:59,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:31:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4900 transitions. [2025-02-05 16:31:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:31:59,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:59,947 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] [2025-02-05 16:31:59,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:31:59,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:31:59,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2051554250, now seen corresponding path program 1 times [2025-02-05 16:31:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594004476] [2025-02-05 16:31:59,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:59,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:31:59,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:31:59,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:59,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:00,893 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:32:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594004476] [2025-02-05 16:32:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594004476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:00,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:00,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:32:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138775491] [2025-02-05 16:32:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:00,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:32:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:00,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:32:00,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:32:00,895 INFO L87 Difference]: Start difference. First operand 3399 states and 4900 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:32:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:03,185 INFO L93 Difference]: Finished difference Result 4734 states and 6814 transitions. [2025-02-05 16:32:03,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:32:03,185 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:32:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:03,195 INFO L225 Difference]: With dead ends: 4734 [2025-02-05 16:32:03,195 INFO L226 Difference]: Without dead ends: 4730 [2025-02-05 16:32:03,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:32:03,198 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 2645 mSDsluCounter, 6558 mSDsCounter, 0 mSdLazyCounter, 2828 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 7127 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:03,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2645 Valid, 7127 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2828 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:32:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2025-02-05 16:32:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 3406. [2025-02-05 16:32:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3402 states have (on average 1.4429747207524986) internal successors, (4909), 3405 states have internal predecessors, (4909), 0 states have call successors, (0), 0 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:32:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4909 transitions. [2025-02-05 16:32:03,245 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 4909 transitions. Word has length 56 [2025-02-05 16:32:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:03,246 INFO L471 AbstractCegarLoop]: Abstraction has 3406 states and 4909 transitions. [2025-02-05 16:32:03,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:32:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 4909 transitions. [2025-02-05 16:32:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:32:03,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:03,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:03,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:32:03,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:03,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash 527339259, now seen corresponding path program 1 times [2025-02-05 16:32:03,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:03,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130283745] [2025-02-05 16:32:03,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:03,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:32:03,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:32:03,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:03,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:03,695 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:32:03,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:03,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130283745] [2025-02-05 16:32:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130283745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:03,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:03,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:32:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680396499] [2025-02-05 16:32:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:03,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:32:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:03,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:32:03,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:32:03,697 INFO L87 Difference]: Start difference. First operand 3406 states and 4909 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:32:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:04,398 INFO L93 Difference]: Finished difference Result 6894 states and 10021 transitions. [2025-02-05 16:32:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:32:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:32:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:04,409 INFO L225 Difference]: With dead ends: 6894 [2025-02-05 16:32:04,409 INFO L226 Difference]: Without dead ends: 6743 [2025-02-05 16:32:04,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:32:04,412 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 3972 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3972 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:04,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3972 Valid, 2402 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:32:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2025-02-05 16:32:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 3351. [2025-02-05 16:32:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3349 states have (on average 1.445207524634219) internal successors, (4840), 3350 states have internal predecessors, (4840), 0 states have call successors, (0), 0 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:32:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4840 transitions. [2025-02-05 16:32:04,480 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4840 transitions. Word has length 56 [2025-02-05 16:32:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:04,480 INFO L471 AbstractCegarLoop]: Abstraction has 3351 states and 4840 transitions. [2025-02-05 16:32:04,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:32:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4840 transitions. [2025-02-05 16:32:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:32:04,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:04,482 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] [2025-02-05 16:32:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:32:04,482 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash -434422058, now seen corresponding path program 1 times [2025-02-05 16:32:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:04,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706951983] [2025-02-05 16:32:04,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:04,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:32:04,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:32:04,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:04,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:05,147 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:32:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706951983] [2025-02-05 16:32:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706951983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:32:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683366844] [2025-02-05 16:32:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:05,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:32:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:05,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:32:05,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:32:05,150 INFO L87 Difference]: Start difference. First operand 3351 states and 4840 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:32:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:06,115 INFO L93 Difference]: Finished difference Result 4939 states and 7099 transitions. [2025-02-05 16:32:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:32:06,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 16:32:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:06,122 INFO L225 Difference]: With dead ends: 4939 [2025-02-05 16:32:06,123 INFO L226 Difference]: Without dead ends: 4791 [2025-02-05 16:32:06,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:32:06,126 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2689 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 3557 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:06,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 3557 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:32:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2025-02-05 16:32:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 3299. [2025-02-05 16:32:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 3298 states have (on average 1.4460278956943602) internal successors, (4769), 3298 states have internal predecessors, (4769), 0 states have call successors, (0), 0 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:32:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4769 transitions. [2025-02-05 16:32:06,167 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4769 transitions. Word has length 57 [2025-02-05 16:32:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:06,168 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 4769 transitions. [2025-02-05 16:32:06,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:32:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4769 transitions. [2025-02-05 16:32:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:32:06,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:06,171 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] [2025-02-05 16:32:06,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:32:06,171 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:06,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash 812015939, now seen corresponding path program 1 times [2025-02-05 16:32:06,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:06,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83109964] [2025-02-05 16:32:06,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:06,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:06,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:32:06,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:32:06,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:06,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:06,253 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:32:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:06,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83109964] [2025-02-05 16:32:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83109964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:06,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:06,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:06,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154117195] [2025-02-05 16:32:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:06,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:06,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:06,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:06,255 INFO L87 Difference]: Start difference. First operand 3299 states and 4769 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:32:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:06,351 INFO L93 Difference]: Finished difference Result 10256 states and 15162 transitions. [2025-02-05 16:32:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:06,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-02-05 16:32:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:06,363 INFO L225 Difference]: With dead ends: 10256 [2025-02-05 16:32:06,363 INFO L226 Difference]: Without dead ends: 7534 [2025-02-05 16:32:06,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:32:06,369 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1595 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:06,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 984 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2025-02-05 16:32:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 5718. [2025-02-05 16:32:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.4455133811439567) internal successors, (8264), 5717 states have internal predecessors, (8264), 0 states have call successors, (0), 0 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:32:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8264 transitions. [2025-02-05 16:32:06,476 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8264 transitions. Word has length 63 [2025-02-05 16:32:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:06,476 INFO L471 AbstractCegarLoop]: Abstraction has 5718 states and 8264 transitions. [2025-02-05 16:32:06,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:32:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8264 transitions. [2025-02-05 16:32:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:32:06,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:06,479 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] [2025-02-05 16:32:06,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:32:06,479 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:06,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash -529650830, now seen corresponding path program 1 times [2025-02-05 16:32:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710585527] [2025-02-05 16:32:06,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:06,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:32:06,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:32:06,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:06,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:06,595 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:32:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:06,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710585527] [2025-02-05 16:32:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710585527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:06,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:06,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:06,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612583304] [2025-02-05 16:32:06,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:06,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:06,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:06,598 INFO L87 Difference]: Start difference. First operand 5718 states and 8264 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:32:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:06,700 INFO L93 Difference]: Finished difference Result 9724 states and 14141 transitions. [2025-02-05 16:32:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:06,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:32:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:06,709 INFO L225 Difference]: With dead ends: 9724 [2025-02-05 16:32:06,709 INFO L226 Difference]: Without dead ends: 4562 [2025-02-05 16:32:06,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:06,716 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 754 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:06,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 875 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4562 states. [2025-02-05 16:32:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4562 to 4558. [2025-02-05 16:32:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4558 states, 4557 states have (on average 1.4318630678077682) internal successors, (6525), 4557 states have internal predecessors, (6525), 0 states have call successors, (0), 0 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:32:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4558 states to 4558 states and 6525 transitions. [2025-02-05 16:32:06,782 INFO L78 Accepts]: Start accepts. Automaton has 4558 states and 6525 transitions. Word has length 64 [2025-02-05 16:32:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:06,783 INFO L471 AbstractCegarLoop]: Abstraction has 4558 states and 6525 transitions. [2025-02-05 16:32:06,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:32:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4558 states and 6525 transitions. [2025-02-05 16:32:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:32:06,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:06,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:06,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:32:06,786 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:06,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash 894073034, now seen corresponding path program 1 times [2025-02-05 16:32:06,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:06,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968478714] [2025-02-05 16:32:06,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:06,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:32:06,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:32:06,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:06,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:06,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:06,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968478714] [2025-02-05 16:32:06,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968478714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:06,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:06,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684081830] [2025-02-05 16:32:06,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:06,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:06,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:06,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:06,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:06,880 INFO L87 Difference]: Start difference. First operand 4558 states and 6525 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:32:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:06,951 INFO L93 Difference]: Finished difference Result 12182 states and 17659 transitions. [2025-02-05 16:32:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:32:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:06,962 INFO L225 Difference]: With dead ends: 12182 [2025-02-05 16:32:06,962 INFO L226 Difference]: Without dead ends: 8180 [2025-02-05 16:32:06,967 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:32:06,968 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 278 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:06,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 813 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2025-02-05 16:32:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 7666. [2025-02-05 16:32:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7666 states, 7665 states have (on average 1.4360078277886497) internal successors, (11007), 7665 states have internal predecessors, (11007), 0 states have call successors, (0), 0 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:32:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7666 states to 7666 states and 11007 transitions. [2025-02-05 16:32:07,057 INFO L78 Accepts]: Start accepts. Automaton has 7666 states and 11007 transitions. Word has length 66 [2025-02-05 16:32:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:07,057 INFO L471 AbstractCegarLoop]: Abstraction has 7666 states and 11007 transitions. [2025-02-05 16:32:07,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:32:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7666 states and 11007 transitions. [2025-02-05 16:32:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:32:07,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:07,059 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:32:07,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:32:07,060 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:07,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2139934006, now seen corresponding path program 1 times [2025-02-05 16:32:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:07,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663906210] [2025-02-05 16:32:07,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:07,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:32:07,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:32:07,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:07,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:07,151 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:32:07,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663906210] [2025-02-05 16:32:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663906210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:07,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:07,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:07,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288053364] [2025-02-05 16:32:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:07,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:07,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:07,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:07,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:07,154 INFO L87 Difference]: Start difference. First operand 7666 states and 11007 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:32:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:07,271 INFO L93 Difference]: Finished difference Result 21126 states and 30489 transitions. [2025-02-05 16:32:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:07,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:32:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:07,292 INFO L225 Difference]: With dead ends: 21126 [2025-02-05 16:32:07,292 INFO L226 Difference]: Without dead ends: 13994 [2025-02-05 16:32:07,303 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:32:07,304 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 298 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:07,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 772 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13994 states. [2025-02-05 16:32:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13994 to 12968. [2025-02-05 16:32:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12968 states, 12967 states have (on average 1.4299375337394926) internal successors, (18542), 12967 states have internal predecessors, (18542), 0 states have call successors, (0), 0 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:32:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12968 states to 12968 states and 18542 transitions. [2025-02-05 16:32:07,467 INFO L78 Accepts]: Start accepts. Automaton has 12968 states and 18542 transitions. Word has length 67 [2025-02-05 16:32:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:07,467 INFO L471 AbstractCegarLoop]: Abstraction has 12968 states and 18542 transitions. [2025-02-05 16:32:07,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:32:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 12968 states and 18542 transitions. [2025-02-05 16:32:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:32:07,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:07,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:07,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:32:07,470 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:07,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash 942935603, now seen corresponding path program 1 times [2025-02-05 16:32:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:07,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461805554] [2025-02-05 16:32:07,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:07,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:07,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:32:07,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:32:07,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:07,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:07,683 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:32:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461805554] [2025-02-05 16:32:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461805554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:32:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987031922] [2025-02-05 16:32:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:07,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:32:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:07,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:32:07,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:32:07,685 INFO L87 Difference]: Start difference. First operand 12968 states and 18542 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:32:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:07,743 INFO L93 Difference]: Finished difference Result 14074 states and 20015 transitions. [2025-02-05 16:32:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:32:07,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:32:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:07,762 INFO L225 Difference]: With dead ends: 14074 [2025-02-05 16:32:07,762 INFO L226 Difference]: Without dead ends: 14072 [2025-02-05 16:32:07,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:32:07,767 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:07,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2410 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14072 states. [2025-02-05 16:32:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14072 to 14072. [2025-02-05 16:32:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14072 states, 14071 states have (on average 1.3962049605571742) internal successors, (19646), 14071 states have internal predecessors, (19646), 0 states have call successors, (0), 0 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:32:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 19646 transitions. [2025-02-05 16:32:07,955 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 19646 transitions. Word has length 68 [2025-02-05 16:32:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 14072 states and 19646 transitions. [2025-02-05 16:32:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:32:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 19646 transitions. [2025-02-05 16:32:07,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:32:07,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:07,957 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:32:07,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:32:07,957 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:07,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:07,958 INFO L85 PathProgramCache]: Analyzing trace with hash -647897854, now seen corresponding path program 1 times [2025-02-05 16:32:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:07,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522450623] [2025-02-05 16:32:07,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:07,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:07,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:32:07,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:32:07,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:07,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:08,010 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:32:08,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:08,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522450623] [2025-02-05 16:32:08,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522450623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:08,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:08,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732761321] [2025-02-05 16:32:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:08,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:08,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:08,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:08,012 INFO L87 Difference]: Start difference. First operand 14072 states and 19646 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:32:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:08,134 INFO L93 Difference]: Finished difference Result 38072 states and 53282 transitions. [2025-02-05 16:32:08,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:08,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:32:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:08,177 INFO L225 Difference]: With dead ends: 38072 [2025-02-05 16:32:08,177 INFO L226 Difference]: Without dead ends: 24522 [2025-02-05 16:32:08,196 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:32:08,197 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 298 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:08,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 700 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24522 states. [2025-02-05 16:32:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24522 to 24152. [2025-02-05 16:32:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24152 states, 24151 states have (on average 1.3715374104591942) internal successors, (33124), 24151 states have internal predecessors, (33124), 0 states have call successors, (0), 0 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:32:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 33124 transitions. [2025-02-05 16:32:08,648 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 33124 transitions. Word has length 69 [2025-02-05 16:32:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:08,649 INFO L471 AbstractCegarLoop]: Abstraction has 24152 states and 33124 transitions. [2025-02-05 16:32:08,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:32:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 33124 transitions. [2025-02-05 16:32:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:32:08,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:08,651 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:32:08,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:32:08,652 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:08,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash 468687705, now seen corresponding path program 1 times [2025-02-05 16:32:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113576641] [2025-02-05 16:32:08,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:08,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:32:08,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:32:08,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:08,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:08,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:32:08,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:08,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113576641] [2025-02-05 16:32:08,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113576641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:08,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:08,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:08,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328637143] [2025-02-05 16:32:08,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:08,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:08,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:08,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:08,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:08,741 INFO L87 Difference]: Start difference. First operand 24152 states and 33124 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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:32:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:08,892 INFO L93 Difference]: Finished difference Result 41434 states and 56994 transitions. [2025-02-05 16:32:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:08,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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:32:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:08,935 INFO L225 Difference]: With dead ends: 41434 [2025-02-05 16:32:08,936 INFO L226 Difference]: Without dead ends: 34352 [2025-02-05 16:32:08,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:08,954 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 1055 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:08,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1222 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34352 states. [2025-02-05 16:32:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34352 to 29898. [2025-02-05 16:32:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29898 states, 29897 states have (on average 1.3667592066093588) internal successors, (40862), 29897 states have internal predecessors, (40862), 0 states have call successors, (0), 0 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:32:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29898 states to 29898 states and 40862 transitions. [2025-02-05 16:32:09,468 INFO L78 Accepts]: Start accepts. Automaton has 29898 states and 40862 transitions. Word has length 73 [2025-02-05 16:32:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:09,468 INFO L471 AbstractCegarLoop]: Abstraction has 29898 states and 40862 transitions. [2025-02-05 16:32:09,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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:32:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 29898 states and 40862 transitions. [2025-02-05 16:32:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:32:09,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:09,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:09,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:32:09,472 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:09,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash -110200026, now seen corresponding path program 1 times [2025-02-05 16:32:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528154099] [2025-02-05 16:32:09,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:09,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:32:09,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:32:09,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:09,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:09,588 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:32:09,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:09,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528154099] [2025-02-05 16:32:09,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528154099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:09,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:09,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993470193] [2025-02-05 16:32:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:09,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:09,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:09,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:09,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:09,591 INFO L87 Difference]: Start difference. First operand 29898 states and 40862 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:09,795 INFO L93 Difference]: Finished difference Result 47122 states and 64610 transitions. [2025-02-05 16:32:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-02-05 16:32:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:10,012 INFO L225 Difference]: With dead ends: 47122 [2025-02-05 16:32:10,013 INFO L226 Difference]: Without dead ends: 38416 [2025-02-05 16:32:10,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:10,020 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 981 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:10,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1219 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38416 states. [2025-02-05 16:32:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38416 to 36138. [2025-02-05 16:32:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36138 states, 36137 states have (on average 1.3618728726789717) internal successors, (49214), 36137 states have internal predecessors, (49214), 0 states have call successors, (0), 0 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:32:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36138 states to 36138 states and 49214 transitions. [2025-02-05 16:32:10,563 INFO L78 Accepts]: Start accepts. Automaton has 36138 states and 49214 transitions. Word has length 74 [2025-02-05 16:32:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:10,563 INFO L471 AbstractCegarLoop]: Abstraction has 36138 states and 49214 transitions. [2025-02-05 16:32:10,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 36138 states and 49214 transitions. [2025-02-05 16:32:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:32:10,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:10,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:32:10,566 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash -818945244, now seen corresponding path program 1 times [2025-02-05 16:32:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044148679] [2025-02-05 16:32:10,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:10,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:32:10,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:32:10,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:10,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:10,648 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:32:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044148679] [2025-02-05 16:32:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044148679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:10,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:10,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563350862] [2025-02-05 16:32:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:10,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:10,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:10,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:10,650 INFO L87 Difference]: Start difference. First operand 36138 states and 49214 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:10,847 INFO L93 Difference]: Finished difference Result 51242 states and 70074 transitions. [2025-02-05 16:32:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:10,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-02-05 16:32:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:10,909 INFO L225 Difference]: With dead ends: 51242 [2025-02-05 16:32:10,909 INFO L226 Difference]: Without dead ends: 44160 [2025-02-05 16:32:10,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:10,929 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 968 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:10,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1309 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44160 states. [2025-02-05 16:32:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44160 to 41882. [2025-02-05 16:32:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41882 states, 41881 states have (on average 1.3598051622454097) internal successors, (56950), 41881 states have internal predecessors, (56950), 0 states have call successors, (0), 0 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:32:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41882 states to 41882 states and 56950 transitions. [2025-02-05 16:32:11,841 INFO L78 Accepts]: Start accepts. Automaton has 41882 states and 56950 transitions. Word has length 74 [2025-02-05 16:32:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:11,841 INFO L471 AbstractCegarLoop]: Abstraction has 41882 states and 56950 transitions. [2025-02-05 16:32:11,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 41882 states and 56950 transitions. [2025-02-05 16:32:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:32:11,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:11,846 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:32:11,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:32:11,846 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:11,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1570297016, now seen corresponding path program 1 times [2025-02-05 16:32:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:11,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733046975] [2025-02-05 16:32:11,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:11,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:32:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:32:11,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:11,983 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:32:11,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733046975] [2025-02-05 16:32:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733046975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:11,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:11,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:11,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873514005] [2025-02-05 16:32:11,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:11,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:11,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:11,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:11,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:11,985 INFO L87 Difference]: Start difference. First operand 41882 states and 56950 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:12,196 INFO L93 Difference]: Finished difference Result 56672 states and 77185 transitions. [2025-02-05 16:32:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:32:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:12,260 INFO L225 Difference]: With dead ends: 56672 [2025-02-05 16:32:12,261 INFO L226 Difference]: Without dead ends: 43846 [2025-02-05 16:32:12,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:12,285 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1006 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:12,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1265 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43846 states. [2025-02-05 16:32:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43846 to 41570. [2025-02-05 16:32:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41570 states, 41569 states have (on average 1.3575019846520244) internal successors, (56430), 41569 states have internal predecessors, (56430), 0 states have call successors, (0), 0 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:32:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41570 states to 41570 states and 56430 transitions. [2025-02-05 16:32:13,040 INFO L78 Accepts]: Start accepts. Automaton has 41570 states and 56430 transitions. Word has length 81 [2025-02-05 16:32:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:13,041 INFO L471 AbstractCegarLoop]: Abstraction has 41570 states and 56430 transitions. [2025-02-05 16:32:13,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 41570 states and 56430 transitions. [2025-02-05 16:32:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:32:13,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:13,046 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:32:13,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:32:13,046 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:13,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1005273969, now seen corresponding path program 1 times [2025-02-05 16:32:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:13,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269889326] [2025-02-05 16:32:13,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:13,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:32:13,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:32:13,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:13,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:13,191 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:32:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:13,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269889326] [2025-02-05 16:32:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269889326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:13,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:32:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306758252] [2025-02-05 16:32:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:32:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:13,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:32:13,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:13,192 INFO L87 Difference]: Start difference. First operand 41570 states and 56430 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 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:32:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:13,758 INFO L93 Difference]: Finished difference Result 50931 states and 69021 transitions. [2025-02-05 16:32:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:32:13,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 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:32:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:13,831 INFO L225 Difference]: With dead ends: 50931 [2025-02-05 16:32:13,832 INFO L226 Difference]: Without dead ends: 49838 [2025-02-05 16:32:13,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:32:13,856 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1958 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:13,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 613 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:32:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49838 states. [2025-02-05 16:32:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49838 to 41565. [2025-02-05 16:32:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41565 states, 41564 states have (on average 1.3574487537291888) internal successors, (56421), 41564 states have internal predecessors, (56421), 0 states have call successors, (0), 0 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:32:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41565 states to 41565 states and 56421 transitions. [2025-02-05 16:32:14,452 INFO L78 Accepts]: Start accepts. Automaton has 41565 states and 56421 transitions. Word has length 82 [2025-02-05 16:32:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:14,452 INFO L471 AbstractCegarLoop]: Abstraction has 41565 states and 56421 transitions. [2025-02-05 16:32:14,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 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:32:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 41565 states and 56421 transitions. [2025-02-05 16:32:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:32:14,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:14,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:14,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:32:14,461 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:14,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1128340839, now seen corresponding path program 1 times [2025-02-05 16:32:14,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598384849] [2025-02-05 16:32:14,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:14,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:32:14,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:32:14,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:14,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:32:14,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598384849] [2025-02-05 16:32:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598384849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:14,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:32:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852629562] [2025-02-05 16:32:14,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:14,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:32:14,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:14,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:32:14,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:32:14,822 INFO L87 Difference]: Start difference. First operand 41565 states and 56421 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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:32:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:15,652 INFO L93 Difference]: Finished difference Result 92098 states and 123780 transitions. [2025-02-05 16:32:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:32:15,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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 88 [2025-02-05 16:32:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:15,852 INFO L225 Difference]: With dead ends: 92098 [2025-02-05 16:32:15,852 INFO L226 Difference]: Without dead ends: 60875 [2025-02-05 16:32:15,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:32:15,879 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1284 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:15,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1231 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:32:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60875 states. [2025-02-05 16:32:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60875 to 41545. [2025-02-05 16:32:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41545 states, 41544 states have (on average 1.3575486231465435) internal successors, (56398), 41544 states have internal predecessors, (56398), 0 states have call successors, (0), 0 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:32:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41545 states to 41545 states and 56398 transitions. [2025-02-05 16:32:16,630 INFO L78 Accepts]: Start accepts. Automaton has 41545 states and 56398 transitions. Word has length 88 [2025-02-05 16:32:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:16,630 INFO L471 AbstractCegarLoop]: Abstraction has 41545 states and 56398 transitions. [2025-02-05 16:32:16,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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:32:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 41545 states and 56398 transitions. [2025-02-05 16:32:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:32:16,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:16,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:16,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:32:16,637 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:16,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1167147553, now seen corresponding path program 1 times [2025-02-05 16:32:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:16,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275100847] [2025-02-05 16:32:16,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:16,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:32:16,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:32:16,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:16,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:32:16,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:16,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275100847] [2025-02-05 16:32:16,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275100847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:16,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:16,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:32:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242078823] [2025-02-05 16:32:16,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:16,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:32:16,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:16,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:32:16,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:32:16,865 INFO L87 Difference]: Start difference. First operand 41545 states and 56398 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:17,516 INFO L93 Difference]: Finished difference Result 79249 states and 107425 transitions. [2025-02-05 16:32:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:32:17,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 16:32:17,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:17,589 INFO L225 Difference]: With dead ends: 79249 [2025-02-05 16:32:17,589 INFO L226 Difference]: Without dead ends: 63821 [2025-02-05 16:32:17,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:32:17,616 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 2022 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:17,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 1051 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:32:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63821 states. [2025-02-05 16:32:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63821 to 41533. [2025-02-05 16:32:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41533 states, 41532 states have (on average 1.3576278532216122) internal successors, (56385), 41532 states have internal predecessors, (56385), 0 states have call successors, (0), 0 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:32:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41533 states to 41533 states and 56385 transitions. [2025-02-05 16:32:18,170 INFO L78 Accepts]: Start accepts. Automaton has 41533 states and 56385 transitions. Word has length 89 [2025-02-05 16:32:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:18,170 INFO L471 AbstractCegarLoop]: Abstraction has 41533 states and 56385 transitions. [2025-02-05 16:32:18,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 41533 states and 56385 transitions. [2025-02-05 16:32:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:32:18,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:18,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:18,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:32:18,178 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:18,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash -371195846, now seen corresponding path program 1 times [2025-02-05 16:32:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692023811] [2025-02-05 16:32:18,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:18,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:32:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:32:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:32:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692023811] [2025-02-05 16:32:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692023811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:18,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:18,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:32:18,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888514247] [2025-02-05 16:32:18,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:18,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:32:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:18,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:32:18,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:32:18,454 INFO L87 Difference]: Start difference. First operand 41533 states and 56385 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:19,126 INFO L93 Difference]: Finished difference Result 73697 states and 99586 transitions. [2025-02-05 16:32:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:32:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 16:32:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:19,190 INFO L225 Difference]: With dead ends: 73697 [2025-02-05 16:32:19,190 INFO L226 Difference]: Without dead ends: 58175 [2025-02-05 16:32:19,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:32:19,213 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 2032 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:19,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 1058 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:32:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58175 states. [2025-02-05 16:32:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58175 to 41517. [2025-02-05 16:32:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41517 states, 41516 states have (on average 1.3577175065035167) internal successors, (56367), 41516 states have internal predecessors, (56367), 0 states have call successors, (0), 0 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:32:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41517 states to 41517 states and 56367 transitions. [2025-02-05 16:32:19,842 INFO L78 Accepts]: Start accepts. Automaton has 41517 states and 56367 transitions. Word has length 89 [2025-02-05 16:32:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:19,842 INFO L471 AbstractCegarLoop]: Abstraction has 41517 states and 56367 transitions. [2025-02-05 16:32:19,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 41517 states and 56367 transitions. [2025-02-05 16:32:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:32:19,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:19,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:19,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:32:19,852 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:19,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -899300681, now seen corresponding path program 1 times [2025-02-05 16:32:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:19,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446497873] [2025-02-05 16:32:19,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:19,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:32:19,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:32:19,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:19,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:20,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446497873] [2025-02-05 16:32:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446497873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:20,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:20,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:32:20,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069009507] [2025-02-05 16:32:20,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:20,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:32:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:20,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:32:20,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:32:20,164 INFO L87 Difference]: Start difference. First operand 41517 states and 56367 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:21,267 INFO L93 Difference]: Finished difference Result 94892 states and 127595 transitions. [2025-02-05 16:32:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:32:21,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 16:32:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:21,335 INFO L225 Difference]: With dead ends: 94892 [2025-02-05 16:32:21,335 INFO L226 Difference]: Without dead ends: 63690 [2025-02-05 16:32:21,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:32:21,366 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2003 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:21,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 1604 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:32:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63690 states. [2025-02-05 16:32:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63690 to 41991. [2025-02-05 16:32:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41991 states, 41990 states have (on average 1.3564181948082876) internal successors, (56956), 41990 states have internal predecessors, (56956), 0 states have call successors, (0), 0 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:32:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41991 states to 41991 states and 56956 transitions. [2025-02-05 16:32:21,973 INFO L78 Accepts]: Start accepts. Automaton has 41991 states and 56956 transitions. Word has length 89 [2025-02-05 16:32:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:21,973 INFO L471 AbstractCegarLoop]: Abstraction has 41991 states and 56956 transitions. [2025-02-05 16:32:21,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 41991 states and 56956 transitions. [2025-02-05 16:32:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:32:21,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:21,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:21,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:32:21,982 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:21,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1817460906, now seen corresponding path program 1 times [2025-02-05 16:32:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:21,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48983255] [2025-02-05 16:32:21,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:21,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:21,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:32:22,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:32:22,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:22,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:22,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:22,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48983255] [2025-02-05 16:32:22,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48983255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:22,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:22,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:32:22,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542830059] [2025-02-05 16:32:22,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:22,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:32:22,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:22,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:32:22,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:32:22,268 INFO L87 Difference]: Start difference. First operand 41991 states and 56956 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:23,396 INFO L93 Difference]: Finished difference Result 90526 states and 121630 transitions. [2025-02-05 16:32:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:32:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 16:32:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:23,470 INFO L225 Difference]: With dead ends: 90526 [2025-02-05 16:32:23,470 INFO L226 Difference]: Without dead ends: 75100 [2025-02-05 16:32:23,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:32:23,488 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 2135 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:23,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2135 Valid, 1653 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:32:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75100 states. [2025-02-05 16:32:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75100 to 66440. [2025-02-05 16:32:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66440 states, 66439 states have (on average 1.3493129035656768) internal successors, (89647), 66439 states have internal predecessors, (89647), 0 states have call successors, (0), 0 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:32:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66440 states to 66440 states and 89647 transitions. [2025-02-05 16:32:24,309 INFO L78 Accepts]: Start accepts. Automaton has 66440 states and 89647 transitions. Word has length 90 [2025-02-05 16:32:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 66440 states and 89647 transitions. [2025-02-05 16:32:24,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 66440 states and 89647 transitions. [2025-02-05 16:32:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:32:24,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:24,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:24,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:32:24,319 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:24,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash 600797400, now seen corresponding path program 1 times [2025-02-05 16:32:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266226631] [2025-02-05 16:32:24,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:24,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:32:24,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:32:24,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:24,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266226631] [2025-02-05 16:32:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266226631] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548285469] [2025-02-05 16:32:24,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:24,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:24,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:32:24,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:32:24,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:32:24,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:32:24,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:24,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:24,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:32:24,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:32:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:26,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:32:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548285469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:32:27,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:32:27,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 28 [2025-02-05 16:32:27,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907555565] [2025-02-05 16:32:27,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:32:27,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:32:27,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:27,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:32:27,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:32:27,290 INFO L87 Difference]: Start difference. First operand 66440 states and 89647 transitions. Second operand has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:32:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:39,614 INFO L93 Difference]: Finished difference Result 450969 states and 598893 transitions. [2025-02-05 16:32:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-02-05 16:32:39,615 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 16:32:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:40,309 INFO L225 Difference]: With dead ends: 450969 [2025-02-05 16:32:40,309 INFO L226 Difference]: Without dead ends: 435463 [2025-02-05 16:32:40,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13229 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5976, Invalid=30696, Unknown=0, NotChecked=0, Total=36672 [2025-02-05 16:32:40,453 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 5719 mSDsluCounter, 6884 mSDsCounter, 0 mSdLazyCounter, 8268 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5719 SdHoareTripleChecker+Valid, 7411 SdHoareTripleChecker+Invalid, 8425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 8268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:40,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5719 Valid, 7411 Invalid, 8425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 8268 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 16:32:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435463 states. [2025-02-05 16:32:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435463 to 67018. [2025-02-05 16:32:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67018 states, 67017 states have (on average 1.349209901965173) internal successors, (90420), 67017 states have internal predecessors, (90420), 0 states have call successors, (0), 0 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:32:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67018 states to 67018 states and 90420 transitions. [2025-02-05 16:32:43,577 INFO L78 Accepts]: Start accepts. Automaton has 67018 states and 90420 transitions. Word has length 90 [2025-02-05 16:32:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:43,578 INFO L471 AbstractCegarLoop]: Abstraction has 67018 states and 90420 transitions. [2025-02-05 16:32:43,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:32:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 67018 states and 90420 transitions. [2025-02-05 16:32:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:32:43,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:43,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:43,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:32:43,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-02-05 16:32:43,790 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 16:32:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 329218307, now seen corresponding path program 1 times [2025-02-05 16:32:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:43,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877868408] [2025-02-05 16:32:43,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:43,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:32:43,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:32:43,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:43,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:43,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:43,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877868408] [2025-02-05 16:32:43,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877868408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:43,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324818097] [2025-02-05 16:32:43,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:43,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:43,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:32:43,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process