./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.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.4.2.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 7853b3826176a0fe575c35877885ca2c640283bf6a2200e21b7819452b726d2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:34:49,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:34:49,987 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:34:49,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:34:49,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:34:50,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:34:50,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:34:50,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:34:50,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:34:50,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:34:50,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:34:50,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:34:50,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:34:50,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:34:50,024 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:34:50,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:34:50,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:34:50,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:34:50,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:34:50,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:34:50,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:34:50,026 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 -> 7853b3826176a0fe575c35877885ca2c640283bf6a2200e21b7819452b726d2c [2025-02-05 16:34:50,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:34:50,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:34:50,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:34:50,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:34:50,347 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:34:50,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:34:51,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fed60254f/2769eafcd7ae49cf9d3470f4ede5fa07/FLAG69c8761fe [2025-02-05 16:34:52,088 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:34:52,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:34:52,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fed60254f/2769eafcd7ae49cf9d3470f4ede5fa07/FLAG69c8761fe [2025-02-05 16:34:52,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fed60254f/2769eafcd7ae49cf9d3470f4ede5fa07 [2025-02-05 16:34:52,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:34:52,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:34:52,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:34:52,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:34:52,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:34:52,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:34:52" (1/1) ... [2025-02-05 16:34:52,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fc2296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:52, skipping insertion in model container [2025-02-05 16:34:52,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:34:52" (1/1) ... [2025-02-05 16:34:52,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:34:52,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[28933,28946] [2025-02-05 16:34:52,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[50969,50982] [2025-02-05 16:34:52,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58695,58708] [2025-02-05 16:34:52,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83802,83815] [2025-02-05 16:34:52,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98975,98988] [2025-02-05 16:34:52,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115686,115699] [2025-02-05 16:34:52,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132053,132066] [2025-02-05 16:34:53,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:34:53,048 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:34:53,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[28933,28946] [2025-02-05 16:34:53,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[50969,50982] [2025-02-05 16:34:53,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58695,58708] [2025-02-05 16:34:53,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83802,83815] [2025-02-05 16:34:53,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98975,98988] [2025-02-05 16:34:53,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115686,115699] [2025-02-05 16:34:53,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132053,132066] [2025-02-05 16:34:53,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:34:53,332 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:34:53,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53 WrapperNode [2025-02-05 16:34:53,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:34:53,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:34:53,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:34:53,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:34:53,339 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:34:53" (1/1) ... [2025-02-05 16:34:53,393 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:34:53" (1/1) ... [2025-02-05 16:34:53,545 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9849 [2025-02-05 16:34:53,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:34:53,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:34:53,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:34:53,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:34:53,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,637 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:34:53,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:34:53,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:34:53,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:34:53,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:34:53,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (1/1) ... [2025-02-05 16:34:53,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:34:53,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:34:53,788 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:34:53,795 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:34:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:34:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:34:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:34:53,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:34:54,064 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:34:54,066 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:34:57,931 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9747: havoc main_~node4__m4~55#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-02-05 16:34:57,931 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15032: havoc main_~node4__m4~81#1; [2025-02-05 16:34:57,931 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9219: havoc main_~node4__m4~52#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-02-05 16:34:57,931 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13448: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-02-05 16:34:57,932 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13713: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-02-05 16:34:57,932 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2088: havoc main_~node2__m2~6#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~9#1; [2025-02-05 16:34:57,932 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15301: havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-02-05 16:34:57,932 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10545: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:57,933 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148: havoc main_~node3__m3~20#1; [2025-02-05 16:34:57,933 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6056: havoc main_~node2__m2~20#1; [2025-02-05 16:34:57,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3680: havoc main_~node2__m2~13#1; [2025-02-05 16:34:57,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10555: havoc main_~node3__m3~63#1; [2025-02-05 16:34:57,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3420: havoc main_~node2__m2~12#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~15#1; [2025-02-05 16:34:57,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7384: havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-02-05 16:34:57,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:57,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L780: havoc main_~check__tmp~1#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc main_~node2__m2~8#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8447: havoc main_~node4__m4~48#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13205: havoc main_~node3__m3~76#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3956: havoc main_~node2__m2~14#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6600: havoc main_~node4__m4~37#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10565: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L260: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6339: havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13741: havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10574: havoc main_~node4__m4~60#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12688: havoc main_~node1____CPAchecker_TMP_0~17#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3442: havoc main_~node3__m3~23#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5294: havoc main_~node2__m2~18#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~27#1; [2025-02-05 16:34:57,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2652: havoc main_~node3__m3~15#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917: havoc main_~node3__m3~18#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7147: havoc main_~node1____CPAchecker_TMP_0~6#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~46#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10847: havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12171: havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14553: havoc main_~node2__m2~56#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~84#1;havoc main_~node4__m4~79#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~60#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~83#1;havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4778: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~33#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4254: havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5577: havoc main_~node1____CPAchecker_TMP_0~4#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~37#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14563: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4521: havoc main_~node4__m4~23#1; [2025-02-05 16:34:57,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9542: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~32#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14299: havoc main_~node4__m4~77#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~82#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9278: havoc main_~node1__m1~33#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1;havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7694: havoc main_~node1____CPAchecker_TMP_0~9#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~49#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409: havoc main_~node4__m4~14#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5847: havoc main_~check__tmp~31#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~38#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13247: havoc main_~node4__m4~73#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11398: havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3207: havoc main_~node2__m2~11#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12985: havoc main_~node4__m4~71#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11933: havoc main_~node3__m3~69#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~70#1; [2025-02-05 16:34:57,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6123: havoc main_~check__tmp~33#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~40#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9823: havoc main_~node4__m4~56#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1367: havoc main_~node4__m4~7#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: havoc main_~node3__m3~0#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3747: havoc main_~check__tmp~17#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~26#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11676: havoc main_~node4__m4~66#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14847: havoc main_~node2__m2~58#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~86#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~85#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8506: havoc main_~node1__m1~28#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1;havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2166: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~10#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6659: havoc main_~node1__m1~19#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1;havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925: havoc main_~node1____CPAchecker_TMP_0~5#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~45#1; [2025-02-05 16:34:57,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16968: havoc main_~node2__m2~70#1;havoc main_~node1__m1~77#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~100#1;havoc main_~node4__m4~92#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~76#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~99#1; [2025-02-05 16:34:57,939 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:57,939 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14591: havoc main_~node2____CPAchecker_TMP_1~4#1; [2025-02-05 16:34:57,939 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16441: havoc main_~node4__m4~89#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~73#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~96#1; [2025-02-05 16:34:57,939 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229: havoc main_~node3__m3~21#1; [2025-02-05 16:34:57,939 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494: havoc main_~node3__m3~24#1; [2025-02-05 16:34:57,939 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7458: havoc main_~node2__m2~24#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-02-05 16:34:57,939 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14857: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118: havoc main_~node2__m2~3#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~3#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8253: havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2704: havoc main_~node3__m3~16#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16711: havoc main_~node2____CPAchecker_TMP_1~9#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~75#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~98#1;havoc main_~node4__m4~91#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~74#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~97#1;havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13541: havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: havoc main_~node4__m4~0#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1655: havoc main_~check__tmp~6#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6413: havoc main_~node2__m2~21#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4035: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~28#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~8#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16984: havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-02-05 16:34:57,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15403: havoc main_~node4__m4~83#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~89#1; [2025-02-05 16:34:57,941 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8004: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~51#1;havoc main_~node2__m2~25#1; [2025-02-05 16:34:57,941 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14084: havoc main_~node1____CPAchecker_TMP_0~18#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~81#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~80#1;havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-02-05 16:34:57,941 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986: havoc main_~node4__m4~15#1; [2025-02-05 16:34:57,941 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13294: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-02-05 16:34:57,941 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6688: havoc main_~node2__m2~22#1; [2025-02-05 16:34:57,941 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14885: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-02-05 16:34:57,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15678: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~68#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~91#1;havoc main_~node4__m4~85#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~67#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-02-05 16:34:57,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4844: havoc main_~node2__m2~17#1; [2025-02-05 16:34:57,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4580: havoc main_~node1__m1~11#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-02-05 16:34:57,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2468: havoc main_~node1__m1~5#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-02-05 16:34:57,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15951: havoc main_~node2____CPAchecker_TMP_1~8#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~70#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~93#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~69#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~92#1; [2025-02-05 16:34:57,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17011: havoc main_~node3__m3~91#1; [2025-02-05 16:34:57,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4328: havoc main_~node2__m2~15#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~21#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12259: havoc main_~node3__m3~71#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~72#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9882: havoc main_~node1__m1~35#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1;havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1162: havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14375: havoc main_~node4__m4~78#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12526: havoc main_~node1__m1~51#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~74#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~73#1;havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6450: havoc main_~node4__m4~35#1;havoc main_~node3__m3~42#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5129: havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~26#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~35#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13322: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3281: havoc main_~node3__m3~22#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12002: havoc main_~node4__m4~67#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12800: havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13858: havoc main_~node4__m4~75#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4609: havoc main_~node2__m2~16#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16238: havoc main_~node1__m1~72#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~95#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~87#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~71#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2497: havoc main_~node2__m2~7#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9105: havoc main_~node1____CPAchecker_TMP_0~12#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1;havoc main_~node4__m4~51#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9635: havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10957: havoc main_~node4__m4~62#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10433: havoc main_~node1____CPAchecker_TMP_0~15#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~61#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~60#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7792: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8849: havoc main_~node1____CPAchecker_TMP_0~11#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~29#1; [2025-02-05 16:34:57,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16517: havoc main_~node4__m4~90#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1455: havoc main_~node2__m2~4#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10178: havoc main_~node1____CPAchecker_TMP_0~14#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~59#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~35#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9386: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~31#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc main_~node4__m4~21#1;havoc main_~node3__m3~30#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15200: havoc main_~node1__m1~65#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~88#1;havoc main_~node4__m4~82#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~87#1;havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3573: havoc main_~node3__m3~25#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3045: havoc main_~node1__m1~7#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~14#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7010: havoc main_~node2__m2~23#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~node3__m3~13#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5692: havoc main_~node4__m4~30#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13357: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17058: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731: havoc main_~node2__m2~5#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5431: havoc main_~node1____CPAchecker_TMP_0~3#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~28#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~36#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3583: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~check__tmp~2#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7548: havoc main_~node1____CPAchecker_TMP_0~8#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~48#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14684: havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-02-05 16:34:57,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11780: havoc main_~node3__m3~68#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~69#1;havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-02-05 16:34:57,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6759: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~44#1; [2025-02-05 16:34:57,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L417: havoc main_~node2__m2~1#1; [2025-02-05 16:34:57,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7818: havoc main_~node3__m3~50#1; [2025-02-05 16:34:57,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3592: havoc main_~node4__m4~16#1; [2025-02-05 16:34:57,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12577: havoc main_~node2__m2~47#1; [2025-02-05 16:34:57,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16806: havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-02-05 16:34:57,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15485: havoc main_~node4__m4~84#1; [2025-02-05 16:34:57,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7293: havoc main_~node1____CPAchecker_TMP_0~7#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~47#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2014: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7828: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5980: havoc main_~check__tmp~32#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~39#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074: havoc main_~node2__m2~10#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6246: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~41#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10741: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~63#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13385: havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8365: havoc main_~node4__m4~47#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7837: havoc main_~node4__m4~44#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17086: havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3346: havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: havoc main_~node2__m2~2#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2292: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3880: havoc main_~check__tmp~18#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~27#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15773: havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6524: havoc main_~node4__m4~36#1;havoc main_~node3__m3~43#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12338: havoc main_~node3__m3~72#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11286: havoc main_~node1____CPAchecker_TMP_0~16#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~66#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1;havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4680: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~23#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~32#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11551: havoc main_~node1__m1~45#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~68#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~67#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14987: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3096: havoc main_~node3__m3~19#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14196: havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12348: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571: havoc main_~node3__m3~14#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L461: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4161: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~20#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~29#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5220: havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2843: havoc main_~node2__m2~9#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~13#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1522: havoc main_~check__tmp~5#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12357: havoc main_~node4__m4~68#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5751: havoc main_~node1__m1~17#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12624: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264: havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13420: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4439: havoc main_~node4__m4~22#1;havoc main_~node3__m3~31#1; [2025-02-05 16:34:57,948 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1798: havoc main_~check__tmp~7#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~9#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13163: havoc main_~node2__m2~50#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~77#1;havoc main_~node4__m4~72#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~76#1;havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12106: havoc main_~node3__m3~70#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~71#1;havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15013: havoc main_~node3__m3~82#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16070: havoc main_~node4__m4~87#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3651: havoc main_~node1__m1~9#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8673: havoc main_~node1____CPAchecker_TMP_0~10#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~28#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11845: havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12903: havoc main_~node4__m4~70#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~75#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16339: havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8940: havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2865: havoc main_~node3__m3~17#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10002: havoc main_~node1____CPAchecker_TMP_0~13#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~34#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15023: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-02-05 16:34:57,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11060: havoc main_~node4__m4~63#1; [2025-02-05 16:34:57,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13703: havoc main_~node2__m2~52#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~79#1;havoc main_~node4__m4~74#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~78#1; [2025-02-05 16:34:57,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10268: havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-02-05 16:34:57,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4983: havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~34#1; [2025-02-05 16:34:57,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10535: havoc main_~node2__m2~37#1; [2025-02-05 16:34:57,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5780: havoc main_~node2__m2~19#1; [2025-02-05 16:34:57,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12652: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:57,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8160: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~26#1; [2025-02-05 16:34:57,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7896: havoc main_~node1__m1~26#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1;havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-02-05 16:34:58,210 INFO L? ?]: Removed 1723 outVars from TransFormulas that were not future-live. [2025-02-05 16:34:58,210 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:34:58,251 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:34:58,251 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:34:58,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:34:58 BoogieIcfgContainer [2025-02-05 16:34:58,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:34:58,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:34:58,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:34:58,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:34:58,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:34:52" (1/3) ... [2025-02-05 16:34:58,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708f3230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:34:58, skipping insertion in model container [2025-02-05 16:34:58,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:53" (2/3) ... [2025-02-05 16:34:58,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708f3230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:34:58, skipping insertion in model container [2025-02-05 16:34:58,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:34:58" (3/3) ... [2025-02-05 16:34:58,269 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:34:58,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:34:58,295 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 2029 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-02-05 16:34:58,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:34:58,390 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;@4210d65c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:34:58,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-05 16:34:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 2029 states, 2021 states have (on average 1.7986145472538346) internal successors, (3635), 2028 states have internal predecessors, (3635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:34:58,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:58,419 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:34:58,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:58,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash 731049621, now seen corresponding path program 1 times [2025-02-05 16:34:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953789849] [2025-02-05 16:34:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:58,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:34:58,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:34:58,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:58,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:58,875 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:34:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953789849] [2025-02-05 16:34:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953789849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:58,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:58,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148893825] [2025-02-05 16:34:58,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:58,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:58,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:58,905 INFO L87 Difference]: Start difference. First operand has 2029 states, 2021 states have (on average 1.7986145472538346) internal successors, (3635), 2028 states have internal predecessors, (3635), 0 states have call successors, (0), 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 12.8) internal successors, (64), 4 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:35:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:01,052 INFO L93 Difference]: Finished difference Result 3990 states and 7067 transitions. [2025-02-05 16:35:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:01,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 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:35:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:01,071 INFO L225 Difference]: With dead ends: 3990 [2025-02-05 16:35:01,071 INFO L226 Difference]: Without dead ends: 2653 [2025-02-05 16:35:01,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:01,079 INFO L435 NwaCegarLoop]: 1970 mSDtfsCounter, 12896 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12896 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:01,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12896 Valid, 2579 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:35:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2025-02-05 16:35:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2647. [2025-02-05 16:35:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2640 states have (on average 1.3321969696969698) internal successors, (3517), 2646 states have internal predecessors, (3517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3517 transitions. [2025-02-05 16:35:01,170 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3517 transitions. Word has length 64 [2025-02-05 16:35:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:01,170 INFO L471 AbstractCegarLoop]: Abstraction has 2647 states and 3517 transitions. [2025-02-05 16:35:01,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 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:35:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3517 transitions. [2025-02-05 16:35:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:35:01,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:01,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:01,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:35:01,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:01,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1978741455, now seen corresponding path program 1 times [2025-02-05 16:35:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:01,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423944786] [2025-02-05 16:35:01,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:01,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:01,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:35:01,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:35:01,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:01,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:01,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423944786] [2025-02-05 16:35:01,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423944786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:01,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:01,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:01,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315661689] [2025-02-05 16:35:01,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:01,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:01,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:01,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:01,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:01,348 INFO L87 Difference]: Start difference. First operand 2647 states and 3517 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:02,706 INFO L93 Difference]: Finished difference Result 4535 states and 6097 transitions. [2025-02-05 16:35:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:02,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:35:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:02,720 INFO L225 Difference]: With dead ends: 4535 [2025-02-05 16:35:02,720 INFO L226 Difference]: Without dead ends: 2930 [2025-02-05 16:35:02,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:02,725 INFO L435 NwaCegarLoop]: 1082 mSDtfsCounter, 7798 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7798 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:02,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7798 Valid, 1463 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:35:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2025-02-05 16:35:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2917. [2025-02-05 16:35:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2910 states have (on average 1.354639175257732) internal successors, (3942), 2916 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 3942 transitions. [2025-02-05 16:35:02,787 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 3942 transitions. Word has length 65 [2025-02-05 16:35:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:02,788 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 3942 transitions. [2025-02-05 16:35:02,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3942 transitions. [2025-02-05 16:35:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:35:02,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:02,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:02,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:35:02,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:02,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 18500882, now seen corresponding path program 1 times [2025-02-05 16:35:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:02,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582132077] [2025-02-05 16:35:02,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:02,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:35:02,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:35:02,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:02,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:02,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582132077] [2025-02-05 16:35:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582132077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:02,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669097179] [2025-02-05 16:35:02,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:02,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:02,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:02,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:02,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:02,963 INFO L87 Difference]: Start difference. First operand 2917 states and 3942 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:04,144 INFO L93 Difference]: Finished difference Result 6144 states and 8391 transitions. [2025-02-05 16:35:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:04,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:35:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:04,174 INFO L225 Difference]: With dead ends: 6144 [2025-02-05 16:35:04,175 INFO L226 Difference]: Without dead ends: 4033 [2025-02-05 16:35:04,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:04,189 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 7612 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7612 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:04,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7612 Valid, 1434 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:35:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2025-02-05 16:35:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 4019. [2025-02-05 16:35:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 4012 states have (on average 1.3504486540378864) internal successors, (5418), 4018 states have internal predecessors, (5418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5418 transitions. [2025-02-05 16:35:04,279 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5418 transitions. Word has length 65 [2025-02-05 16:35:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:04,280 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5418 transitions. [2025-02-05 16:35:04,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5418 transitions. [2025-02-05 16:35:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:35:04,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:04,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:35:04,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 186146385, now seen corresponding path program 1 times [2025-02-05 16:35:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504808475] [2025-02-05 16:35:04,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:04,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:35:04,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:35:04,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:04,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504808475] [2025-02-05 16:35:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504808475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:04,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073666138] [2025-02-05 16:35:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:04,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:04,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:04,850 INFO L87 Difference]: Start difference. First operand 4019 states and 5418 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:06,944 INFO L93 Difference]: Finished difference Result 4767 states and 6473 transitions. [2025-02-05 16:35:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:06,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:35:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:06,955 INFO L225 Difference]: With dead ends: 4767 [2025-02-05 16:35:06,955 INFO L226 Difference]: Without dead ends: 4762 [2025-02-05 16:35:06,956 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:35:06,959 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 10911 mSDsluCounter, 3438 mSDsCounter, 0 mSdLazyCounter, 4482 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10911 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 4510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:06,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10911 Valid, 4526 Invalid, 4510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4482 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:35:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4762 states. [2025-02-05 16:35:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4762 to 4019. [2025-02-05 16:35:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 4012 states have (on average 1.3501994017946162) internal successors, (5417), 4018 states have internal predecessors, (5417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5417 transitions. [2025-02-05 16:35:07,085 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5417 transitions. Word has length 66 [2025-02-05 16:35:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:07,087 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5417 transitions. [2025-02-05 16:35:07,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5417 transitions. [2025-02-05 16:35:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:35:07,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:07,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:07,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:35:07,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:07,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1773490010, now seen corresponding path program 1 times [2025-02-05 16:35:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:07,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157537547] [2025-02-05 16:35:07,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:07,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:35:07,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:35:07,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:07,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157537547] [2025-02-05 16:35:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157537547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:07,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546217125] [2025-02-05 16:35:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:07,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:07,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:07,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:07,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:07,424 INFO L87 Difference]: Start difference. First operand 4019 states and 5417 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:10,091 INFO L93 Difference]: Finished difference Result 5795 states and 7978 transitions. [2025-02-05 16:35:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:35:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:10,103 INFO L225 Difference]: With dead ends: 5795 [2025-02-05 16:35:10,103 INFO L226 Difference]: Without dead ends: 4978 [2025-02-05 16:35:10,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:35:10,106 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 10454 mSDsluCounter, 4550 mSDsCounter, 0 mSdLazyCounter, 6081 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10454 SdHoareTripleChecker+Valid, 5604 SdHoareTripleChecker+Invalid, 6092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 6081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:10,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10454 Valid, 5604 Invalid, 6092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 6081 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 16:35:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2025-02-05 16:35:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4026. [2025-02-05 16:35:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4026 states, 4019 states have (on average 1.349589450111968) internal successors, (5424), 4025 states have internal predecessors, (5424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 5424 transitions. [2025-02-05 16:35:10,171 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 5424 transitions. Word has length 66 [2025-02-05 16:35:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:10,171 INFO L471 AbstractCegarLoop]: Abstraction has 4026 states and 5424 transitions. [2025-02-05 16:35:10,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 5424 transitions. [2025-02-05 16:35:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:10,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:10,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:10,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:35:10,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:10,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1709885693, now seen corresponding path program 1 times [2025-02-05 16:35:10,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:10,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881784978] [2025-02-05 16:35:10,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:10,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:10,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:10,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:10,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:10,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:10,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:10,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881784978] [2025-02-05 16:35:10,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881784978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:10,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143179593] [2025-02-05 16:35:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:10,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:10,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:10,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:10,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:10,265 INFO L87 Difference]: Start difference. First operand 4026 states and 5424 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:11,175 INFO L93 Difference]: Finished difference Result 7926 states and 10750 transitions. [2025-02-05 16:35:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:35:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:11,188 INFO L225 Difference]: With dead ends: 7926 [2025-02-05 16:35:11,188 INFO L226 Difference]: Without dead ends: 5310 [2025-02-05 16:35:11,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:11,192 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 6558 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6558 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:11,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6558 Valid, 1245 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:35:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2025-02-05 16:35:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 5300. [2025-02-05 16:35:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5300 states, 5293 states have (on average 1.3534857358775743) internal successors, (7164), 5299 states have internal predecessors, (7164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 7164 transitions. [2025-02-05 16:35:11,252 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 7164 transitions. Word has length 67 [2025-02-05 16:35:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:11,253 INFO L471 AbstractCegarLoop]: Abstraction has 5300 states and 7164 transitions. [2025-02-05 16:35:11,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 7164 transitions. [2025-02-05 16:35:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:11,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:11,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:11,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:35:11,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1181028711, now seen corresponding path program 1 times [2025-02-05 16:35:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193678211] [2025-02-05 16:35:11,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:11,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:11,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:11,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193678211] [2025-02-05 16:35:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193678211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:11,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:35:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518881443] [2025-02-05 16:35:11,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:11,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:35:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:11,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:35:11,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:35:11,917 INFO L87 Difference]: Start difference. First operand 5300 states and 7164 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:13,686 INFO L93 Difference]: Finished difference Result 10551 states and 14822 transitions. [2025-02-05 16:35:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:35:13,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:35:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:13,705 INFO L225 Difference]: With dead ends: 10551 [2025-02-05 16:35:13,706 INFO L226 Difference]: Without dead ends: 9219 [2025-02-05 16:35:13,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:35:13,709 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 9434 mSDsluCounter, 11015 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9434 SdHoareTripleChecker+Valid, 12563 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:13,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9434 Valid, 12563 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:35:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9219 states. [2025-02-05 16:35:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9219 to 5202. [2025-02-05 16:35:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5202 states, 5196 states have (on average 1.3525789068514242) internal successors, (7028), 5201 states have internal predecessors, (7028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 7028 transitions. [2025-02-05 16:35:13,798 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 7028 transitions. Word has length 67 [2025-02-05 16:35:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:13,798 INFO L471 AbstractCegarLoop]: Abstraction has 5202 states and 7028 transitions. [2025-02-05 16:35:13,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 7028 transitions. [2025-02-05 16:35:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:13,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:13,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:13,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:35:13,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:13,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash 180660293, now seen corresponding path program 1 times [2025-02-05 16:35:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:13,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437995444] [2025-02-05 16:35:13,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:13,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:13,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:13,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:13,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:13,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:13,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437995444] [2025-02-05 16:35:13,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437995444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:13,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:13,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:13,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209508072] [2025-02-05 16:35:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:13,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:13,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:13,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:13,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:13,866 INFO L87 Difference]: Start difference. First operand 5202 states and 7028 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:35:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:14,048 INFO L93 Difference]: Finished difference Result 10450 states and 14301 transitions. [2025-02-05 16:35:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:14,048 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:35:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:14,057 INFO L225 Difference]: With dead ends: 10450 [2025-02-05 16:35:14,058 INFO L226 Difference]: Without dead ends: 6337 [2025-02-05 16:35:14,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:14,061 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 1611 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:14,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 2193 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2025-02-05 16:35:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 6327. [2025-02-05 16:35:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6327 states, 6321 states have (on average 1.3537414965986394) internal successors, (8557), 6326 states have internal predecessors, (8557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6327 states to 6327 states and 8557 transitions. [2025-02-05 16:35:14,134 INFO L78 Accepts]: Start accepts. Automaton has 6327 states and 8557 transitions. Word has length 67 [2025-02-05 16:35:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:14,134 INFO L471 AbstractCegarLoop]: Abstraction has 6327 states and 8557 transitions. [2025-02-05 16:35:14,134 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:35:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6327 states and 8557 transitions. [2025-02-05 16:35:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:14,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:14,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:14,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:35:14,138 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:14,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:14,139 INFO L85 PathProgramCache]: Analyzing trace with hash -172529293, now seen corresponding path program 1 times [2025-02-05 16:35:14,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:14,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36563704] [2025-02-05 16:35:14,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:14,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:14,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:14,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:14,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:14,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:14,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36563704] [2025-02-05 16:35:14,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36563704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:14,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:14,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:35:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251322316] [2025-02-05 16:35:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:14,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:35:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:14,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:35:14,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:14,566 INFO L87 Difference]: Start difference. First operand 6327 states and 8557 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:15,803 INFO L93 Difference]: Finished difference Result 8638 states and 11963 transitions. [2025-02-05 16:35:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:15,804 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:35:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:15,815 INFO L225 Difference]: With dead ends: 8638 [2025-02-05 16:35:15,816 INFO L226 Difference]: Without dead ends: 8634 [2025-02-05 16:35:15,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:35:15,819 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 8205 mSDsluCounter, 8770 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8205 SdHoareTripleChecker+Valid, 10279 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:15,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8205 Valid, 10279 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:35:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8634 states. [2025-02-05 16:35:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8634 to 6323. [2025-02-05 16:35:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6323 states, 6318 states have (on average 1.3537511870845205) internal successors, (8553), 6322 states have internal predecessors, (8553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 8553 transitions. [2025-02-05 16:35:15,888 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 8553 transitions. Word has length 67 [2025-02-05 16:35:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:15,888 INFO L471 AbstractCegarLoop]: Abstraction has 6323 states and 8553 transitions. [2025-02-05 16:35:15,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 8553 transitions. [2025-02-05 16:35:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:15,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:15,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:15,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:35:15,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:15,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2009074341, now seen corresponding path program 1 times [2025-02-05 16:35:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748184294] [2025-02-05 16:35:15,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:15,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:15,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:15,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:15,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748184294] [2025-02-05 16:35:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748184294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:16,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:16,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804188725] [2025-02-05 16:35:16,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:16,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:16,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:16,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:16,123 INFO L87 Difference]: Start difference. First operand 6323 states and 8553 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:18,431 INFO L93 Difference]: Finished difference Result 10093 states and 14022 transitions. [2025-02-05 16:35:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:35:18,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:35:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:18,442 INFO L225 Difference]: With dead ends: 10093 [2025-02-05 16:35:18,442 INFO L226 Difference]: Without dead ends: 8204 [2025-02-05 16:35:18,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:35:18,446 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 7138 mSDsluCounter, 4484 mSDsCounter, 0 mSdLazyCounter, 5170 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7138 SdHoareTripleChecker+Valid, 5365 SdHoareTripleChecker+Invalid, 5200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:18,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7138 Valid, 5365 Invalid, 5200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5170 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 16:35:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2025-02-05 16:35:18,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 6256. [2025-02-05 16:35:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6256 states, 6251 states have (on average 1.3529035354343306) internal successors, (8457), 6255 states have internal predecessors, (8457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6256 states to 6256 states and 8457 transitions. [2025-02-05 16:35:18,557 INFO L78 Accepts]: Start accepts. Automaton has 6256 states and 8457 transitions. Word has length 68 [2025-02-05 16:35:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:18,557 INFO L471 AbstractCegarLoop]: Abstraction has 6256 states and 8457 transitions. [2025-02-05 16:35:18,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6256 states and 8457 transitions. [2025-02-05 16:35:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:18,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:18,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:18,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:35:18,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash 78495105, now seen corresponding path program 1 times [2025-02-05 16:35:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:18,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965447748] [2025-02-05 16:35:18,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:18,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:18,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:18,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:18,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:18,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:18,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965447748] [2025-02-05 16:35:18,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965447748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:18,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:18,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:18,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829623859] [2025-02-05 16:35:18,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:18,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:18,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:18,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:18,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:18,871 INFO L87 Difference]: Start difference. First operand 6256 states and 8457 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:21,012 INFO L93 Difference]: Finished difference Result 9800 states and 13480 transitions. [2025-02-05 16:35:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:21,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:35:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:21,038 INFO L225 Difference]: With dead ends: 9800 [2025-02-05 16:35:21,039 INFO L226 Difference]: Without dead ends: 9792 [2025-02-05 16:35:21,046 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:35:21,047 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 7642 mSDsluCounter, 3686 mSDsCounter, 0 mSdLazyCounter, 4545 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7642 SdHoareTripleChecker+Valid, 4649 SdHoareTripleChecker+Invalid, 4579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:21,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7642 Valid, 4649 Invalid, 4579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4545 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:35:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2025-02-05 16:35:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 6256. [2025-02-05 16:35:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6256 states, 6251 states have (on average 1.3527435610302352) internal successors, (8456), 6255 states have internal predecessors, (8456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6256 states to 6256 states and 8456 transitions. [2025-02-05 16:35:21,224 INFO L78 Accepts]: Start accepts. Automaton has 6256 states and 8456 transitions. Word has length 69 [2025-02-05 16:35:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:21,224 INFO L471 AbstractCegarLoop]: Abstraction has 6256 states and 8456 transitions. [2025-02-05 16:35:21,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6256 states and 8456 transitions. [2025-02-05 16:35:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:21,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:21,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:21,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:35:21,229 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:21,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash -418692786, now seen corresponding path program 1 times [2025-02-05 16:35:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:21,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104774876] [2025-02-05 16:35:21,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:21,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:21,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:21,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:21,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104774876] [2025-02-05 16:35:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104774876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:21,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:35:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113642259] [2025-02-05 16:35:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:35:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:21,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:35:21,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:21,718 INFO L87 Difference]: Start difference. First operand 6256 states and 8456 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:23,064 INFO L93 Difference]: Finished difference Result 10750 states and 15116 transitions. [2025-02-05 16:35:23,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:35:23,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:35:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:23,075 INFO L225 Difference]: With dead ends: 10750 [2025-02-05 16:35:23,075 INFO L226 Difference]: Without dead ends: 8858 [2025-02-05 16:35:23,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:35:23,079 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 10243 mSDsluCounter, 7566 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10243 SdHoareTripleChecker+Valid, 9041 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:23,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10243 Valid, 9041 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:35:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8858 states. [2025-02-05 16:35:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8858 to 6182. [2025-02-05 16:35:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 6178 states have (on average 1.352217546131434) internal successors, (8354), 6181 states have internal predecessors, (8354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 8354 transitions. [2025-02-05 16:35:23,147 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 8354 transitions. Word has length 69 [2025-02-05 16:35:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:23,147 INFO L471 AbstractCegarLoop]: Abstraction has 6182 states and 8354 transitions. [2025-02-05 16:35:23,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 8354 transitions. [2025-02-05 16:35:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:23,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:23,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:23,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:35:23,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1523821271, now seen corresponding path program 1 times [2025-02-05 16:35:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875567554] [2025-02-05 16:35:23,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:23,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:23,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:23,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:23,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875567554] [2025-02-05 16:35:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875567554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:23,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98448056] [2025-02-05 16:35:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:23,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:23,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:23,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:23,331 INFO L87 Difference]: Start difference. First operand 6182 states and 8354 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:25,097 INFO L93 Difference]: Finished difference Result 13445 states and 19096 transitions. [2025-02-05 16:35:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:35:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:25,109 INFO L225 Difference]: With dead ends: 13445 [2025-02-05 16:35:25,110 INFO L226 Difference]: Without dead ends: 11604 [2025-02-05 16:35:25,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:35:25,114 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 7717 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 3895 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7717 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 3936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:25,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7717 Valid, 3976 Invalid, 3936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3895 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:35:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11604 states. [2025-02-05 16:35:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11604 to 6182. [2025-02-05 16:35:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 6178 states have (on average 1.3520556814503075) internal successors, (8353), 6181 states have internal predecessors, (8353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 8353 transitions. [2025-02-05 16:35:25,206 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 8353 transitions. Word has length 70 [2025-02-05 16:35:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:25,206 INFO L471 AbstractCegarLoop]: Abstraction has 6182 states and 8353 transitions. [2025-02-05 16:35:25,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 8353 transitions. [2025-02-05 16:35:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:25,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:25,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:25,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:35:25,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:25,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash -239425070, now seen corresponding path program 1 times [2025-02-05 16:35:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549566493] [2025-02-05 16:35:25,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:25,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:25,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:25,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:25,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:26,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:26,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549566493] [2025-02-05 16:35:26,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549566493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:26,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:35:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470482856] [2025-02-05 16:35:26,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:26,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:35:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:26,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:35:26,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:35:26,026 INFO L87 Difference]: Start difference. First operand 6182 states and 8353 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:27,724 INFO L93 Difference]: Finished difference Result 11763 states and 16352 transitions. [2025-02-05 16:35:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:35:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:35:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:27,735 INFO L225 Difference]: With dead ends: 11763 [2025-02-05 16:35:27,735 INFO L226 Difference]: Without dead ends: 11752 [2025-02-05 16:35:27,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:35:27,738 INFO L435 NwaCegarLoop]: 1450 mSDtfsCounter, 10707 mSDsluCounter, 10737 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10707 SdHoareTripleChecker+Valid, 12187 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:27,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10707 Valid, 12187 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:35:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11752 states. [2025-02-05 16:35:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 6176. [2025-02-05 16:35:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6176 states, 6172 states have (on average 1.3522359040829552) internal successors, (8346), 6175 states have internal predecessors, (8346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6176 states to 6176 states and 8346 transitions. [2025-02-05 16:35:27,826 INFO L78 Accepts]: Start accepts. Automaton has 6176 states and 8346 transitions. Word has length 70 [2025-02-05 16:35:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:27,826 INFO L471 AbstractCegarLoop]: Abstraction has 6176 states and 8346 transitions. [2025-02-05 16:35:27,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6176 states and 8346 transitions. [2025-02-05 16:35:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:27,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:27,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:27,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:35:27,833 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:27,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1483369029, now seen corresponding path program 1 times [2025-02-05 16:35:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:27,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22535069] [2025-02-05 16:35:27,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:27,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:27,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:27,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:27,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:27,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:27,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22535069] [2025-02-05 16:35:27,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22535069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:27,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:27,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700422398] [2025-02-05 16:35:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:27,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:27,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:27,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:27,885 INFO L87 Difference]: Start difference. First operand 6176 states and 8346 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:27,987 INFO L93 Difference]: Finished difference Result 9910 states and 13829 transitions. [2025-02-05 16:35:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:27,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:35:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:27,994 INFO L225 Difference]: With dead ends: 9910 [2025-02-05 16:35:27,994 INFO L226 Difference]: Without dead ends: 5892 [2025-02-05 16:35:27,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:27,999 INFO L435 NwaCegarLoop]: 1242 mSDtfsCounter, 1198 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:27,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 1719 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2025-02-05 16:35:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5888. [2025-02-05 16:35:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5888 states, 5886 states have (on average 1.385321100917431) internal successors, (8154), 5887 states have internal predecessors, (8154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 8154 transitions. [2025-02-05 16:35:28,046 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 8154 transitions. Word has length 70 [2025-02-05 16:35:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:28,046 INFO L471 AbstractCegarLoop]: Abstraction has 5888 states and 8154 transitions. [2025-02-05 16:35:28,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 8154 transitions. [2025-02-05 16:35:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:35:28,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:28,050 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] [2025-02-05 16:35:28,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:35:28,050 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:28,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1087115756, now seen corresponding path program 1 times [2025-02-05 16:35:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:28,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312095382] [2025-02-05 16:35:28,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:28,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:28,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:35:28,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:35:28,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:28,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:28,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312095382] [2025-02-05 16:35:28,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312095382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:28,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:28,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862113184] [2025-02-05 16:35:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:28,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:28,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:28,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:28,270 INFO L87 Difference]: Start difference. First operand 5888 states and 8154 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:29,678 INFO L93 Difference]: Finished difference Result 9064 states and 12885 transitions. [2025-02-05 16:35:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:29,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-02-05 16:35:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:29,684 INFO L225 Difference]: With dead ends: 9064 [2025-02-05 16:35:29,684 INFO L226 Difference]: Without dead ends: 5976 [2025-02-05 16:35:29,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:35:29,688 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 5918 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5918 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:29,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5918 Valid, 3480 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:35:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2025-02-05 16:35:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5888. [2025-02-05 16:35:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5888 states, 5886 states have (on average 1.3851512062521236) internal successors, (8153), 5887 states have internal predecessors, (8153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 8153 transitions. [2025-02-05 16:35:29,768 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 8153 transitions. Word has length 71 [2025-02-05 16:35:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:29,768 INFO L471 AbstractCegarLoop]: Abstraction has 5888 states and 8153 transitions. [2025-02-05 16:35:29,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 8153 transitions. [2025-02-05 16:35:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:35:29,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:29,772 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] [2025-02-05 16:35:29,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:35:29,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:29,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash -329621886, now seen corresponding path program 1 times [2025-02-05 16:35:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014835855] [2025-02-05 16:35:29,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:29,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:35:29,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:35:29,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:29,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:29,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:29,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014835855] [2025-02-05 16:35:29,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014835855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:29,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:29,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:29,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279267596] [2025-02-05 16:35:29,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:29,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:29,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:29,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:29,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:29,978 INFO L87 Difference]: Start difference. First operand 5888 states and 8153 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:31,656 INFO L93 Difference]: Finished difference Result 10818 states and 15427 transitions. [2025-02-05 16:35:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:35:31,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-02-05 16:35:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:31,664 INFO L225 Difference]: With dead ends: 10818 [2025-02-05 16:35:31,665 INFO L226 Difference]: Without dead ends: 8056 [2025-02-05 16:35:31,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:35:31,670 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 5088 mSDsluCounter, 3783 mSDsCounter, 0 mSdLazyCounter, 3987 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5088 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:31,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5088 Valid, 4533 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3987 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:35:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2025-02-05 16:35:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 5888. [2025-02-05 16:35:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5888 states, 5886 states have (on average 1.3849813115868161) internal successors, (8152), 5887 states have internal predecessors, (8152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 8152 transitions. [2025-02-05 16:35:31,730 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 8152 transitions. Word has length 71 [2025-02-05 16:35:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:31,730 INFO L471 AbstractCegarLoop]: Abstraction has 5888 states and 8152 transitions. [2025-02-05 16:35:31,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 8152 transitions. [2025-02-05 16:35:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:35:31,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:31,734 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] [2025-02-05 16:35:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:35:31,734 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash -333125820, now seen corresponding path program 1 times [2025-02-05 16:35:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:31,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252115972] [2025-02-05 16:35:31,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:31,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:35:31,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:35:31,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:31,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252115972] [2025-02-05 16:35:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252115972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:31,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435715187] [2025-02-05 16:35:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:31,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:31,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:31,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:31,821 INFO L87 Difference]: Start difference. First operand 5888 states and 8152 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:31,877 INFO L93 Difference]: Finished difference Result 10066 states and 14613 transitions. [2025-02-05 16:35:31,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:31,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-02-05 16:35:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:31,886 INFO L225 Difference]: With dead ends: 10066 [2025-02-05 16:35:31,886 INFO L226 Difference]: Without dead ends: 6923 [2025-02-05 16:35:31,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:31,890 INFO L435 NwaCegarLoop]: 1275 mSDtfsCounter, 722 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:31,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1869 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2025-02-05 16:35:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 5595. [2025-02-05 16:35:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5595 states, 5593 states have (on average 1.4142678347934918) internal successors, (7910), 5594 states have internal predecessors, (7910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5595 states to 5595 states and 7910 transitions. [2025-02-05 16:35:31,939 INFO L78 Accepts]: Start accepts. Automaton has 5595 states and 7910 transitions. Word has length 71 [2025-02-05 16:35:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:31,939 INFO L471 AbstractCegarLoop]: Abstraction has 5595 states and 7910 transitions. [2025-02-05 16:35:31,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5595 states and 7910 transitions. [2025-02-05 16:35:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:35:31,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:31,942 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] [2025-02-05 16:35:31,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:35:31,942 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:31,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1080635698, now seen corresponding path program 1 times [2025-02-05 16:35:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950310861] [2025-02-05 16:35:31,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:31,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:31,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:35:31,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:35:31,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:31,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950310861] [2025-02-05 16:35:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950310861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690660480] [2025-02-05 16:35:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:31,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:31,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:31,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:31,991 INFO L87 Difference]: Start difference. First operand 5595 states and 7910 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:32,073 INFO L93 Difference]: Finished difference Result 12052 states and 17767 transitions. [2025-02-05 16:35:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:32,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-02-05 16:35:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:32,082 INFO L225 Difference]: With dead ends: 12052 [2025-02-05 16:35:32,082 INFO L226 Difference]: Without dead ends: 8145 [2025-02-05 16:35:32,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:32,088 INFO L435 NwaCegarLoop]: 1301 mSDtfsCounter, 744 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:32,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1850 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8145 states. [2025-02-05 16:35:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8145 to 8143. [2025-02-05 16:35:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8143 states, 8141 states have (on average 1.4466281783564672) internal successors, (11777), 8142 states have internal predecessors, (11777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8143 states to 8143 states and 11777 transitions. [2025-02-05 16:35:32,157 INFO L78 Accepts]: Start accepts. Automaton has 8143 states and 11777 transitions. Word has length 72 [2025-02-05 16:35:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:32,157 INFO L471 AbstractCegarLoop]: Abstraction has 8143 states and 11777 transitions. [2025-02-05 16:35:32,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8143 states and 11777 transitions. [2025-02-05 16:35:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:35:32,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:32,160 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] [2025-02-05 16:35:32,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:35:32,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:32,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1936540140, now seen corresponding path program 1 times [2025-02-05 16:35:32,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:32,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355532656] [2025-02-05 16:35:32,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:32,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:32,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:35:32,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:35:32,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:32,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:32,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355532656] [2025-02-05 16:35:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355532656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:32,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:32,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073064275] [2025-02-05 16:35:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:32,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:32,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:32,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:32,283 INFO L87 Difference]: Start difference. First operand 8143 states and 11777 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:32,383 INFO L93 Difference]: Finished difference Result 20728 states and 30558 transitions. [2025-02-05 16:35:32,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-02-05 16:35:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:32,399 INFO L225 Difference]: With dead ends: 20728 [2025-02-05 16:35:32,400 INFO L226 Difference]: Without dead ends: 14051 [2025-02-05 16:35:32,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:32,409 INFO L435 NwaCegarLoop]: 1326 mSDtfsCounter, 774 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:32,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2316 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2025-02-05 16:35:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 14049. [2025-02-05 16:35:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14049 states, 14047 states have (on average 1.4461450843596497) internal successors, (20314), 14048 states have internal predecessors, (20314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14049 states to 14049 states and 20314 transitions. [2025-02-05 16:35:32,575 INFO L78 Accepts]: Start accepts. Automaton has 14049 states and 20314 transitions. Word has length 72 [2025-02-05 16:35:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:32,575 INFO L471 AbstractCegarLoop]: Abstraction has 14049 states and 20314 transitions. [2025-02-05 16:35:32,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 14049 states and 20314 transitions. [2025-02-05 16:35:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:35:32,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:32,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:32,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:35:32,579 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:32,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1398888627, now seen corresponding path program 1 times [2025-02-05 16:35:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:32,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521286385] [2025-02-05 16:35:32,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:32,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:32,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:35:32,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:35:32,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:32,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:32,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521286385] [2025-02-05 16:35:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521286385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:32,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:32,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67734733] [2025-02-05 16:35:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:32,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:32,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:32,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:32,732 INFO L87 Difference]: Start difference. First operand 14049 states and 20314 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:33,856 INFO L93 Difference]: Finished difference Result 18053 states and 25945 transitions. [2025-02-05 16:35:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:35:33,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 16:35:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:33,875 INFO L225 Difference]: With dead ends: 18053 [2025-02-05 16:35:33,875 INFO L226 Difference]: Without dead ends: 17849 [2025-02-05 16:35:33,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:35:33,881 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 4708 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4708 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:33,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4708 Valid, 2773 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:35:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17849 states. [2025-02-05 16:35:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17849 to 14049. [2025-02-05 16:35:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14049 states, 14047 states have (on average 1.446073894781804) internal successors, (20313), 14048 states have internal predecessors, (20313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14049 states to 14049 states and 20313 transitions. [2025-02-05 16:35:34,025 INFO L78 Accepts]: Start accepts. Automaton has 14049 states and 20313 transitions. Word has length 73 [2025-02-05 16:35:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:34,026 INFO L471 AbstractCegarLoop]: Abstraction has 14049 states and 20313 transitions. [2025-02-05 16:35:34,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 14049 states and 20313 transitions. [2025-02-05 16:35:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:35:34,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:34,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:34,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:35:34,031 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:34,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash -410210182, now seen corresponding path program 1 times [2025-02-05 16:35:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973026532] [2025-02-05 16:35:34,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:34,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:35:34,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:35:34,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:34,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:34,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973026532] [2025-02-05 16:35:34,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973026532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:34,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:34,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146401482] [2025-02-05 16:35:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:34,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:34,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:34,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:34,139 INFO L87 Difference]: Start difference. First operand 14049 states and 20313 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:34,341 INFO L93 Difference]: Finished difference Result 29205 states and 42790 transitions. [2025-02-05 16:35:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:34,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 16:35:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:34,378 INFO L225 Difference]: With dead ends: 29205 [2025-02-05 16:35:34,378 INFO L226 Difference]: Without dead ends: 16094 [2025-02-05 16:35:34,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:34,407 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 1113 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:34,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1561 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16094 states. [2025-02-05 16:35:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16094 to 12893. [2025-02-05 16:35:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12893 states, 12891 states have (on average 1.461795050810643) internal successors, (18844), 12892 states have internal predecessors, (18844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12893 states to 12893 states and 18844 transitions. [2025-02-05 16:35:34,544 INFO L78 Accepts]: Start accepts. Automaton has 12893 states and 18844 transitions. Word has length 73 [2025-02-05 16:35:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:34,544 INFO L471 AbstractCegarLoop]: Abstraction has 12893 states and 18844 transitions. [2025-02-05 16:35:34,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 12893 states and 18844 transitions. [2025-02-05 16:35:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:35:34,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:34,547 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:35:34,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:35:34,547 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:34,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:34,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1986680637, now seen corresponding path program 1 times [2025-02-05 16:35:34,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:34,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942269602] [2025-02-05 16:35:34,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:34,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:35:34,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:35:34,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:34,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942269602] [2025-02-05 16:35:34,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942269602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:34,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:34,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:35:34,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036106191] [2025-02-05 16:35:34,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:34,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:35:34,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:34,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:35:34,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:34,908 INFO L87 Difference]: Start difference. First operand 12893 states and 18844 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 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:35:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:36,864 INFO L93 Difference]: Finished difference Result 44450 states and 65533 transitions. [2025-02-05 16:35:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 16:35:36,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 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:35:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:36,910 INFO L225 Difference]: With dead ends: 44450 [2025-02-05 16:35:36,910 INFO L226 Difference]: Without dead ends: 44230 [2025-02-05 16:35:36,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:35:36,926 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 10696 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10696 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:36,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10696 Valid, 2828 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:35:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44230 states. [2025-02-05 16:35:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44230 to 12897. [2025-02-05 16:35:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12897 states, 12895 states have (on average 1.461651803024428) internal successors, (18848), 12896 states have internal predecessors, (18848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12897 states to 12897 states and 18848 transitions. [2025-02-05 16:35:37,252 INFO L78 Accepts]: Start accepts. Automaton has 12897 states and 18848 transitions. Word has length 74 [2025-02-05 16:35:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:37,253 INFO L471 AbstractCegarLoop]: Abstraction has 12897 states and 18848 transitions. [2025-02-05 16:35:37,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 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:35:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12897 states and 18848 transitions. [2025-02-05 16:35:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:35:37,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:37,256 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:35:37,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:35:37,256 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:37,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash 600747196, now seen corresponding path program 1 times [2025-02-05 16:35:37,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:37,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811402815] [2025-02-05 16:35:37,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:37,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:37,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:35:37,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:35:37,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:37,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811402815] [2025-02-05 16:35:37,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811402815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:37,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:37,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398305809] [2025-02-05 16:35:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:37,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:37,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:37,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:37,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:37,479 INFO L87 Difference]: Start difference. First operand 12897 states and 18848 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:38,655 INFO L93 Difference]: Finished difference Result 16576 states and 24071 transitions. [2025-02-05 16:35:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:38,672 INFO L225 Difference]: With dead ends: 16576 [2025-02-05 16:35:38,672 INFO L226 Difference]: Without dead ends: 16375 [2025-02-05 16:35:38,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:35:38,679 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 6013 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6013 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:38,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6013 Valid, 2628 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:35:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16375 states. [2025-02-05 16:35:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16375 to 12897. [2025-02-05 16:35:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12897 states, 12895 states have (on average 1.4615742535866616) internal successors, (18847), 12896 states have internal predecessors, (18847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12897 states to 12897 states and 18847 transitions. [2025-02-05 16:35:38,874 INFO L78 Accepts]: Start accepts. Automaton has 12897 states and 18847 transitions. Word has length 74 [2025-02-05 16:35:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:38,874 INFO L471 AbstractCegarLoop]: Abstraction has 12897 states and 18847 transitions. [2025-02-05 16:35:38,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 12897 states and 18847 transitions. [2025-02-05 16:35:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:35:38,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:38,876 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:35:38,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:35:38,877 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1810077990, now seen corresponding path program 1 times [2025-02-05 16:35:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701573203] [2025-02-05 16:35:38,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:38,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:35:38,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:35:38,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:38,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:39,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:39,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701573203] [2025-02-05 16:35:39,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701573203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:39,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:39,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:39,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434753440] [2025-02-05 16:35:39,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:39,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:39,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:39,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:39,058 INFO L87 Difference]: Start difference. First operand 12897 states and 18847 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:40,160 INFO L93 Difference]: Finished difference Result 16574 states and 24068 transitions. [2025-02-05 16:35:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:40,177 INFO L225 Difference]: With dead ends: 16574 [2025-02-05 16:35:40,177 INFO L226 Difference]: Without dead ends: 16370 [2025-02-05 16:35:40,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:35:40,183 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 5978 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5978 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:40,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5978 Valid, 2596 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:35:40,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16370 states. [2025-02-05 16:35:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16370 to 12892. [2025-02-05 16:35:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12892 states, 12890 states have (on average 1.46144297905353) internal successors, (18838), 12891 states have internal predecessors, (18838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12892 states to 12892 states and 18838 transitions. [2025-02-05 16:35:40,320 INFO L78 Accepts]: Start accepts. Automaton has 12892 states and 18838 transitions. Word has length 74 [2025-02-05 16:35:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:40,320 INFO L471 AbstractCegarLoop]: Abstraction has 12892 states and 18838 transitions. [2025-02-05 16:35:40,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 12892 states and 18838 transitions. [2025-02-05 16:35:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:35:40,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:40,322 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:35:40,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:35:40,322 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:40,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -685479522, now seen corresponding path program 1 times [2025-02-05 16:35:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:40,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708182192] [2025-02-05 16:35:40,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:40,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:35:40,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:35:40,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:40,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:40,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:40,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708182192] [2025-02-05 16:35:40,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708182192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:40,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:40,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757555631] [2025-02-05 16:35:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:40,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:40,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:40,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:40,364 INFO L87 Difference]: Start difference. First operand 12892 states and 18838 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:35:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:40,458 INFO L93 Difference]: Finished difference Result 30434 states and 45129 transitions. [2025-02-05 16:35:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:35:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:40,479 INFO L225 Difference]: With dead ends: 30434 [2025-02-05 16:35:40,480 INFO L226 Difference]: Without dead ends: 18867 [2025-02-05 16:35:40,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:40,492 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 716 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:40,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1707 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18867 states. [2025-02-05 16:35:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18867 to 15160. [2025-02-05 16:35:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15160 states, 15158 states have (on average 1.455864889827154) internal successors, (22068), 15159 states have internal predecessors, (22068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15160 states to 15160 states and 22068 transitions. [2025-02-05 16:35:40,731 INFO L78 Accepts]: Start accepts. Automaton has 15160 states and 22068 transitions. Word has length 74 [2025-02-05 16:35:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:40,731 INFO L471 AbstractCegarLoop]: Abstraction has 15160 states and 22068 transitions. [2025-02-05 16:35:40,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:35:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 15160 states and 22068 transitions. [2025-02-05 16:35:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:35:40,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:40,734 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:35:40,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:35:40,734 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash 781525804, now seen corresponding path program 1 times [2025-02-05 16:35:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:40,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607491323] [2025-02-05 16:35:40,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:40,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:40,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:35:40,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:35:40,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:40,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:41,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607491323] [2025-02-05 16:35:41,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607491323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:41,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:41,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:41,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970253788] [2025-02-05 16:35:41,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:41,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:41,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:41,013 INFO L87 Difference]: Start difference. First operand 15160 states and 22068 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 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:35:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:42,414 INFO L93 Difference]: Finished difference Result 19453 states and 28137 transitions. [2025-02-05 16:35:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 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:35:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:42,435 INFO L225 Difference]: With dead ends: 19453 [2025-02-05 16:35:42,435 INFO L226 Difference]: Without dead ends: 19350 [2025-02-05 16:35:42,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:35:42,443 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 2598 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 3264 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2598 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:42,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2598 Valid, 3340 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3264 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:35:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19350 states. [2025-02-05 16:35:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19350 to 15160. [2025-02-05 16:35:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15160 states, 15158 states have (on average 1.455798918063069) internal successors, (22067), 15159 states have internal predecessors, (22067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15160 states to 15160 states and 22067 transitions. [2025-02-05 16:35:42,633 INFO L78 Accepts]: Start accepts. Automaton has 15160 states and 22067 transitions. Word has length 74 [2025-02-05 16:35:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:42,634 INFO L471 AbstractCegarLoop]: Abstraction has 15160 states and 22067 transitions. [2025-02-05 16:35:42,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 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:35:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 15160 states and 22067 transitions. [2025-02-05 16:35:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:35:42,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:42,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:42,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:35:42,636 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:42,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash -742646659, now seen corresponding path program 1 times [2025-02-05 16:35:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:42,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056437185] [2025-02-05 16:35:42,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:42,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:35:42,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:35:42,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:42,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:42,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056437185] [2025-02-05 16:35:42,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056437185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:42,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763586673] [2025-02-05 16:35:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:42,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:42,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:42,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:42,836 INFO L87 Difference]: Start difference. First operand 15160 states and 22067 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:44,046 INFO L93 Difference]: Finished difference Result 22688 states and 32890 transitions. [2025-02-05 16:35:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:44,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:44,070 INFO L225 Difference]: With dead ends: 22688 [2025-02-05 16:35:44,070 INFO L226 Difference]: Without dead ends: 22612 [2025-02-05 16:35:44,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:35:44,078 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 4983 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4983 SdHoareTripleChecker+Valid, 3021 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:44,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4983 Valid, 3021 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:35:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22612 states. [2025-02-05 16:35:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22612 to 15160. [2025-02-05 16:35:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15160 states, 15158 states have (on average 1.455732946298984) internal successors, (22066), 15159 states have internal predecessors, (22066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15160 states to 15160 states and 22066 transitions. [2025-02-05 16:35:44,246 INFO L78 Accepts]: Start accepts. Automaton has 15160 states and 22066 transitions. Word has length 74 [2025-02-05 16:35:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:44,246 INFO L471 AbstractCegarLoop]: Abstraction has 15160 states and 22066 transitions. [2025-02-05 16:35:44,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 15160 states and 22066 transitions. [2025-02-05 16:35:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:35:44,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:44,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:44,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:35:44,249 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:44,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1774106164, now seen corresponding path program 1 times [2025-02-05 16:35:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095246947] [2025-02-05 16:35:44,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:44,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:35:44,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:35:44,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:44,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095246947] [2025-02-05 16:35:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095246947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:44,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:44,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377696283] [2025-02-05 16:35:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:44,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:44,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:44,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:44,408 INFO L87 Difference]: Start difference. First operand 15160 states and 22066 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:45,451 INFO L93 Difference]: Finished difference Result 19363 states and 27976 transitions. [2025-02-05 16:35:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:45,472 INFO L225 Difference]: With dead ends: 19363 [2025-02-05 16:35:45,472 INFO L226 Difference]: Without dead ends: 19297 [2025-02-05 16:35:45,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:35:45,479 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 5857 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5857 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:45,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5857 Valid, 2583 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:35:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19297 states. [2025-02-05 16:35:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19297 to 15160. [2025-02-05 16:35:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15160 states, 15158 states have (on average 1.4556669745348991) internal successors, (22065), 15159 states have internal predecessors, (22065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15160 states to 15160 states and 22065 transitions. [2025-02-05 16:35:45,697 INFO L78 Accepts]: Start accepts. Automaton has 15160 states and 22065 transitions. Word has length 74 [2025-02-05 16:35:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:45,697 INFO L471 AbstractCegarLoop]: Abstraction has 15160 states and 22065 transitions. [2025-02-05 16:35:45,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 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:35:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 15160 states and 22065 transitions. [2025-02-05 16:35:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:45,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:45,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:45,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:35:45,701 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:45,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -133005339, now seen corresponding path program 1 times [2025-02-05 16:35:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:45,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982143379] [2025-02-05 16:35:45,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:45,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:45,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:45,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982143379] [2025-02-05 16:35:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982143379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:45,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:45,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:45,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411579555] [2025-02-05 16:35:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:45,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:45,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:45,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:45,919 INFO L87 Difference]: Start difference. First operand 15160 states and 22065 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:47,240 INFO L93 Difference]: Finished difference Result 22688 states and 32888 transitions. [2025-02-05 16:35:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:35:47,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:35:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:47,263 INFO L225 Difference]: With dead ends: 22688 [2025-02-05 16:35:47,264 INFO L226 Difference]: Without dead ends: 22612 [2025-02-05 16:35:47,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:35:47,272 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 4959 mSDsluCounter, 2402 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4959 SdHoareTripleChecker+Valid, 3035 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:47,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4959 Valid, 3035 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2915 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:35:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22612 states. [2025-02-05 16:35:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22612 to 15156. [2025-02-05 16:35:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15156 states, 15154 states have (on average 1.455721261713079) internal successors, (22060), 15155 states have internal predecessors, (22060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15156 states to 15156 states and 22060 transitions. [2025-02-05 16:35:47,435 INFO L78 Accepts]: Start accepts. Automaton has 15156 states and 22060 transitions. Word has length 75 [2025-02-05 16:35:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:47,435 INFO L471 AbstractCegarLoop]: Abstraction has 15156 states and 22060 transitions. [2025-02-05 16:35:47,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 15156 states and 22060 transitions. [2025-02-05 16:35:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:35:47,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:47,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:47,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:35:47,437 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:47,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2065438990, now seen corresponding path program 1 times [2025-02-05 16:35:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:47,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380710555] [2025-02-05 16:35:47,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:47,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:35:47,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:35:47,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:47,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:47,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:47,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380710555] [2025-02-05 16:35:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380710555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:47,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:35:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075783151] [2025-02-05 16:35:47,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:47,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:35:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:47,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:35:47,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:47,902 INFO L87 Difference]: Start difference. First operand 15156 states and 22060 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:49,002 INFO L93 Difference]: Finished difference Result 32483 states and 47274 transitions. [2025-02-05 16:35:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:35:49,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 16:35:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:49,040 INFO L225 Difference]: With dead ends: 32483 [2025-02-05 16:35:49,040 INFO L226 Difference]: Without dead ends: 32358 [2025-02-05 16:35:49,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:35:49,051 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 7245 mSDsluCounter, 5810 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7245 SdHoareTripleChecker+Valid, 6830 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:49,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7245 Valid, 6830 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:35:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32358 states. [2025-02-05 16:35:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32358 to 15095. [2025-02-05 16:35:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15095 states, 15094 states have (on average 1.4562077646747051) internal successors, (21980), 15094 states have internal predecessors, (21980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15095 states to 15095 states and 21980 transitions. [2025-02-05 16:35:49,274 INFO L78 Accepts]: Start accepts. Automaton has 15095 states and 21980 transitions. Word has length 76 [2025-02-05 16:35:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:49,274 INFO L471 AbstractCegarLoop]: Abstraction has 15095 states and 21980 transitions. [2025-02-05 16:35:49,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 15095 states and 21980 transitions. [2025-02-05 16:35:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:35:49,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:49,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:49,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:35:49,277 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:49,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash 15136615, now seen corresponding path program 1 times [2025-02-05 16:35:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:49,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140945144] [2025-02-05 16:35:49,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:49,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:35:49,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:35:49,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:49,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140945144] [2025-02-05 16:35:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140945144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:49,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:49,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003067457] [2025-02-05 16:35:49,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:49,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:49,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:49,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:49,342 INFO L87 Difference]: Start difference. First operand 15095 states and 21980 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:49,566 INFO L93 Difference]: Finished difference Result 57927 states and 85063 transitions. [2025-02-05 16:35:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:49,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 16:35:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:49,615 INFO L225 Difference]: With dead ends: 57927 [2025-02-05 16:35:49,615 INFO L226 Difference]: Without dead ends: 43973 [2025-02-05 16:35:49,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:49,635 INFO L435 NwaCegarLoop]: 1076 mSDtfsCounter, 3799 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3799 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:49,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3799 Valid, 2320 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:49,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43973 states. [2025-02-05 16:35:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43973 to 28297. [2025-02-05 16:35:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28297 states, 28296 states have (on average 1.4483319197059654) internal successors, (40982), 28296 states have internal predecessors, (40982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28297 states to 28297 states and 40982 transitions. [2025-02-05 16:35:50,058 INFO L78 Accepts]: Start accepts. Automaton has 28297 states and 40982 transitions. Word has length 76 [2025-02-05 16:35:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:50,059 INFO L471 AbstractCegarLoop]: Abstraction has 28297 states and 40982 transitions. [2025-02-05 16:35:50,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 28297 states and 40982 transitions. [2025-02-05 16:35:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:50,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:50,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:50,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:35:50,062 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:50,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1183025717, now seen corresponding path program 1 times [2025-02-05 16:35:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:50,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582654677] [2025-02-05 16:35:50,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:50,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:50,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:50,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:50,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:51,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582654677] [2025-02-05 16:35:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582654677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-05 16:35:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188514447] [2025-02-05 16:35:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:51,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 16:35:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:51,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 16:35:51,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:35:51,110 INFO L87 Difference]: Start difference. First operand 28297 states and 40982 transitions. Second operand has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:55,480 INFO L93 Difference]: Finished difference Result 52454 states and 75596 transitions. [2025-02-05 16:35:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 16:35:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:35:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:55,542 INFO L225 Difference]: With dead ends: 52454 [2025-02-05 16:35:55,542 INFO L226 Difference]: Without dead ends: 52389 [2025-02-05 16:35:55,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 16:35:55,561 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 11785 mSDsluCounter, 14241 mSDsCounter, 0 mSdLazyCounter, 6385 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11785 SdHoareTripleChecker+Valid, 15196 SdHoareTripleChecker+Invalid, 6403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:55,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11785 Valid, 15196 Invalid, 6403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6385 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 16:35:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52389 states. [2025-02-05 16:35:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52389 to 28315. [2025-02-05 16:35:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28315 states, 28314 states have (on average 1.4482588118951756) internal successors, (41006), 28314 states have internal predecessors, (41006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28315 states to 28315 states and 41006 transitions. [2025-02-05 16:35:56,092 INFO L78 Accepts]: Start accepts. Automaton has 28315 states and 41006 transitions. Word has length 77 [2025-02-05 16:35:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:56,093 INFO L471 AbstractCegarLoop]: Abstraction has 28315 states and 41006 transitions. [2025-02-05 16:35:56,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 28315 states and 41006 transitions. [2025-02-05 16:35:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:56,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:56,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:56,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:35:56,097 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:56,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1402980231, now seen corresponding path program 1 times [2025-02-05 16:35:56,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:56,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557048976] [2025-02-05 16:35:56,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:56,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:56,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:56,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:56,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:56,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:56,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:56,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557048976] [2025-02-05 16:35:56,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557048976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:56,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:56,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:35:56,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644717616] [2025-02-05 16:35:56,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:56,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:35:56,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:56,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:35:56,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:56,473 INFO L87 Difference]: Start difference. First operand 28315 states and 41006 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:57,247 INFO L93 Difference]: Finished difference Result 49023 states and 70948 transitions. [2025-02-05 16:35:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:57,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:35:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:57,303 INFO L225 Difference]: With dead ends: 49023 [2025-02-05 16:35:57,304 INFO L226 Difference]: Without dead ends: 48958 [2025-02-05 16:35:57,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:35:57,322 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 5255 mSDsluCounter, 4841 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5255 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:57,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5255 Valid, 5794 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:35:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48958 states. [2025-02-05 16:35:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48958 to 28314. [2025-02-05 16:35:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28314 states, 28313 states have (on average 1.4482393246918377) internal successors, (41004), 28313 states have internal predecessors, (41004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28314 states to 28314 states and 41004 transitions. [2025-02-05 16:35:57,722 INFO L78 Accepts]: Start accepts. Automaton has 28314 states and 41004 transitions. Word has length 77 [2025-02-05 16:35:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:57,722 INFO L471 AbstractCegarLoop]: Abstraction has 28314 states and 41004 transitions. [2025-02-05 16:35:57,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 28314 states and 41004 transitions. [2025-02-05 16:35:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:57,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:57,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:57,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:35:57,726 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:57,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1708413223, now seen corresponding path program 1 times [2025-02-05 16:35:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:57,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459896334] [2025-02-05 16:35:57,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:57,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:57,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:57,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459896334] [2025-02-05 16:35:58,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459896334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:58,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:58,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-02-05 16:35:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282708908] [2025-02-05 16:35:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:58,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:35:58,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:58,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:35:58,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:35:58,720 INFO L87 Difference]: Start difference. First operand 28314 states and 41004 transitions. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:01,980 INFO L93 Difference]: Finished difference Result 52456 states and 75594 transitions. [2025-02-05 16:36:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 16:36:01,981 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:36:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:02,046 INFO L225 Difference]: With dead ends: 52456 [2025-02-05 16:36:02,046 INFO L226 Difference]: Without dead ends: 52389 [2025-02-05 16:36:02,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=333, Invalid=1559, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:36:02,065 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 8507 mSDsluCounter, 13094 mSDsCounter, 0 mSdLazyCounter, 5446 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8507 SdHoareTripleChecker+Valid, 14080 SdHoareTripleChecker+Invalid, 5469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:02,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8507 Valid, 14080 Invalid, 5469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5446 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 16:36:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52389 states. [2025-02-05 16:36:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52389 to 28325. [2025-02-05 16:36:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28325 states, 28324 states have (on average 1.4481711622652167) internal successors, (41018), 28324 states have internal predecessors, (41018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28325 states to 28325 states and 41018 transitions. [2025-02-05 16:36:02,488 INFO L78 Accepts]: Start accepts. Automaton has 28325 states and 41018 transitions. Word has length 77 [2025-02-05 16:36:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:02,488 INFO L471 AbstractCegarLoop]: Abstraction has 28325 states and 41018 transitions. [2025-02-05 16:36:02,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 28325 states and 41018 transitions. [2025-02-05 16:36:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:36:02,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:02,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:02,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:36:02,491 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:36:02,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash 457411310, now seen corresponding path program 1 times [2025-02-05 16:36:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:02,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299165843] [2025-02-05 16:36:02,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:02,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:36:02,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:36:02,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:02,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:02,577 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:36:02,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:02,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299165843] [2025-02-05 16:36:02,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299165843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:02,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:02,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:36:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880275799] [2025-02-05 16:36:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:36:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:02,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:36:02,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:36:02,579 INFO L87 Difference]: Start difference. First operand 28325 states and 41018 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:02,777 INFO L93 Difference]: Finished difference Result 47813 states and 69272 transitions. [2025-02-05 16:36:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:36:02,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:36:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:02,800 INFO L225 Difference]: With dead ends: 47813 [2025-02-05 16:36:02,800 INFO L226 Difference]: Without dead ends: 20618 [2025-02-05 16:36:02,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:36:02,821 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 1673 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:02,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1849 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20618 states. [2025-02-05 16:36:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20618 to 20612. [2025-02-05 16:36:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20612 states, 20611 states have (on average 1.4335548978700694) internal successors, (29547), 20611 states have internal predecessors, (29547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20612 states to 20612 states and 29547 transitions. [2025-02-05 16:36:03,012 INFO L78 Accepts]: Start accepts. Automaton has 20612 states and 29547 transitions. Word has length 77 [2025-02-05 16:36:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:03,014 INFO L471 AbstractCegarLoop]: Abstraction has 20612 states and 29547 transitions. [2025-02-05 16:36:03,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 20612 states and 29547 transitions. [2025-02-05 16:36:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:36:03,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:03,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:03,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:36:03,018 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:36:03,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash 381890264, now seen corresponding path program 1 times [2025-02-05 16:36:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672065543] [2025-02-05 16:36:03,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:03,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:36:03,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:36:03,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:03,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:03,341 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:36:03,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:03,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672065543] [2025-02-05 16:36:03,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672065543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:03,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:03,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:36:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631363180] [2025-02-05 16:36:03,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:03,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:36:03,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:03,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:36:03,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:36:03,343 INFO L87 Difference]: Start difference. First operand 20612 states and 29547 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:04,089 INFO L93 Difference]: Finished difference Result 36117 states and 51831 transitions. [2025-02-05 16:36:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:36:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:36:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:04,136 INFO L225 Difference]: With dead ends: 36117 [2025-02-05 16:36:04,136 INFO L226 Difference]: Without dead ends: 36052 [2025-02-05 16:36:04,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:36:04,151 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 5876 mSDsluCounter, 4056 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5876 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:04,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5876 Valid, 4973 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:36:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36052 states. [2025-02-05 16:36:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36052 to 20599. [2025-02-05 16:36:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20599 states, 20598 states have (on average 1.433537236624915) internal successors, (29528), 20598 states have internal predecessors, (29528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20599 states to 20599 states and 29528 transitions. [2025-02-05 16:36:04,424 INFO L78 Accepts]: Start accepts. Automaton has 20599 states and 29528 transitions. Word has length 78 [2025-02-05 16:36:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:04,424 INFO L471 AbstractCegarLoop]: Abstraction has 20599 states and 29528 transitions. [2025-02-05 16:36:04,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 20599 states and 29528 transitions. [2025-02-05 16:36:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:36:04,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:04,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:04,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:36:04,428 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:36:04,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:04,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1785418620, now seen corresponding path program 1 times [2025-02-05 16:36:04,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:04,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875913675] [2025-02-05 16:36:04,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:04,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:36:04,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:36:04,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:04,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:05,380 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:36:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875913675] [2025-02-05 16:36:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875913675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-02-05 16:36:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140467354] [2025-02-05 16:36:05,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:05,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:36:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:05,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:36:05,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:36:05,382 INFO L87 Difference]: Start difference. First operand 20599 states and 29528 transitions. Second operand has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:09,392 INFO L93 Difference]: Finished difference Result 60607 states and 86669 transitions. [2025-02-05 16:36:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 16:36:09,393 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:36:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:09,461 INFO L225 Difference]: With dead ends: 60607 [2025-02-05 16:36:09,461 INFO L226 Difference]: Without dead ends: 60540 [2025-02-05 16:36:09,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=682, Invalid=2288, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 16:36:09,484 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 13701 mSDsluCounter, 12210 mSDsCounter, 0 mSdLazyCounter, 4511 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13701 SdHoareTripleChecker+Valid, 13171 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:09,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13701 Valid, 13171 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4511 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 16:36:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60540 states. [2025-02-05 16:36:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60540 to 20582. [2025-02-05 16:36:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20582 states, 20581 states have (on average 1.4336038093387105) internal successors, (29505), 20581 states have internal predecessors, (29505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20582 states to 20582 states and 29505 transitions. [2025-02-05 16:36:09,878 INFO L78 Accepts]: Start accepts. Automaton has 20582 states and 29505 transitions. Word has length 78 [2025-02-05 16:36:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:09,878 INFO L471 AbstractCegarLoop]: Abstraction has 20582 states and 29505 transitions. [2025-02-05 16:36:09,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 20582 states and 29505 transitions. [2025-02-05 16:36:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:36:09,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:09,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:09,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:36:09,888 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:36:09,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:09,888 INFO L85 PathProgramCache]: Analyzing trace with hash -594842833, now seen corresponding path program 1 times [2025-02-05 16:36:09,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:09,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159184221] [2025-02-05 16:36:09,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:09,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:36:09,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:36:09,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:09,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:10,470 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:36:10,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:10,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159184221] [2025-02-05 16:36:10,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159184221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:10,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:10,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:36:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530683733] [2025-02-05 16:36:10,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:10,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:36:10,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:10,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:36:10,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:36:10,472 INFO L87 Difference]: Start difference. First operand 20582 states and 29505 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:11,452 INFO L93 Difference]: Finished difference Result 28242 states and 40492 transitions. [2025-02-05 16:36:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:36:11,452 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:36:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:11,482 INFO L225 Difference]: With dead ends: 28242 [2025-02-05 16:36:11,482 INFO L226 Difference]: Without dead ends: 28153 [2025-02-05 16:36:11,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:36:11,492 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 2276 mSDsluCounter, 7421 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 8374 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:11,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2276 Valid, 8374 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:36:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28153 states. [2025-02-05 16:36:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28153 to 20589. [2025-02-05 16:36:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20589 states, 20588 states have (on average 1.4335049543423353) internal successors, (29513), 20588 states have internal predecessors, (29513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20589 states to 20589 states and 29513 transitions. [2025-02-05 16:36:11,710 INFO L78 Accepts]: Start accepts. Automaton has 20589 states and 29513 transitions. Word has length 78 [2025-02-05 16:36:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:11,710 INFO L471 AbstractCegarLoop]: Abstraction has 20589 states and 29513 transitions. [2025-02-05 16:36:11,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 20589 states and 29513 transitions. [2025-02-05 16:36:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:36:11,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:11,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:11,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:36:11,714 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:36:11,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash 430542040, now seen corresponding path program 1 times [2025-02-05 16:36:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184665924] [2025-02-05 16:36:11,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:11,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:36:11,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:36:11,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:11,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184665924] [2025-02-05 16:36:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184665924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:11,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:11,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113117233] [2025-02-05 16:36:11,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:11,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:11,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:11,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:11,770 INFO L87 Difference]: Start difference. First operand 20589 states and 29513 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:11,920 INFO L93 Difference]: Finished difference Result 58099 states and 83659 transitions. [2025-02-05 16:36:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:11,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:36:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:11,961 INFO L225 Difference]: With dead ends: 58099 [2025-02-05 16:36:11,962 INFO L226 Difference]: Without dead ends: 38617 [2025-02-05 16:36:11,996 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:36:12,000 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 549 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:12,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1540 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38617 states. [2025-02-05 16:36:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38617 to 36663. [2025-02-05 16:36:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36663 states, 36662 states have (on average 1.4308821122688342) internal successors, (52459), 36662 states have internal predecessors, (52459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36663 states to 36663 states and 52459 transitions. [2025-02-05 16:36:12,394 INFO L78 Accepts]: Start accepts. Automaton has 36663 states and 52459 transitions. Word has length 78 [2025-02-05 16:36:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:12,394 INFO L471 AbstractCegarLoop]: Abstraction has 36663 states and 52459 transitions. [2025-02-05 16:36:12,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36663 states and 52459 transitions. [2025-02-05 16:36:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:36:12,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:12,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:12,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:36:12,397 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:36:12,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 339761900, now seen corresponding path program 1 times [2025-02-05 16:36:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:12,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395360421] [2025-02-05 16:36:12,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:12,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:36:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:36:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:13,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:36:13,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:13,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395360421] [2025-02-05 16:36:13,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395360421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:13,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:13,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 16:36:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289524022] [2025-02-05 16:36:13,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 16:36:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:13,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 16:36:13,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:36:13,012 INFO L87 Difference]: Start difference. First operand 36663 states and 52459 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:14,282 INFO L93 Difference]: Finished difference Result 66338 states and 94746 transitions. [2025-02-05 16:36:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:36:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 16:36:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:14,362 INFO L225 Difference]: With dead ends: 66338 [2025-02-05 16:36:14,362 INFO L226 Difference]: Without dead ends: 66198 [2025-02-05 16:36:14,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:36:14,386 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 6390 mSDsluCounter, 6384 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6390 SdHoareTripleChecker+Valid, 7268 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:14,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6390 Valid, 7268 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:36:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66198 states. [2025-02-05 16:36:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66198 to 36631. [2025-02-05 16:36:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36631 states, 36630 states have (on average 1.431094731094731) internal successors, (52421), 36630 states have internal predecessors, (52421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36631 states to 36631 states and 52421 transitions. [2025-02-05 16:36:14,931 INFO L78 Accepts]: Start accepts. Automaton has 36631 states and 52421 transitions. Word has length 79 [2025-02-05 16:36:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:14,931 INFO L471 AbstractCegarLoop]: Abstraction has 36631 states and 52421 transitions. [2025-02-05 16:36:14,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 36631 states and 52421 transitions. [2025-02-05 16:36:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:36:14,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:14,942 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:36:14,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:36:14,942 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:36:14,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1838875019, now seen corresponding path program 1 times [2025-02-05 16:36:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:14,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335458541] [2025-02-05 16:36:14,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:14,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:36:14,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:36:14,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:14,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:15,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335458541] [2025-02-05 16:36:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335458541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814565158] [2025-02-05 16:36:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:15,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:15,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:15,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:15,004 INFO L87 Difference]: Start difference. First operand 36631 states and 52421 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:15,266 INFO L93 Difference]: Finished difference Result 104835 states and 150103 transitions. [2025-02-05 16:36:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:36:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:15,341 INFO L225 Difference]: With dead ends: 104835 [2025-02-05 16:36:15,342 INFO L226 Difference]: Without dead ends: 69279 [2025-02-05 16:36:15,376 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:36:15,378 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 414 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:15,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1578 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69279 states.