./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-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.1.ufo.UNBOUNDED.pals.c.v+lhb-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 f1b965f33911949d5293afac2c8bd242d07bfd4e9981eefc7864b2608138df3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:34:00,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:34:00,263 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:00,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:34:00,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:34:00,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:34:00,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:34:00,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:34:00,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:34:00,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:34:00,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:34:00,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:34:00,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:34:00,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:34:00,300 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:34:00,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:34:00,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:34:00,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:34:00,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:34:00,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:34:00,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:34:00,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:34:00,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:34:00,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:34:00,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:34:00,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:34:00,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:34:00,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:34:00,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:34:00,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:34:00,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:34:00,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:34:00,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:34:00,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:34:00,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:34:00,304 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 -> f1b965f33911949d5293afac2c8bd242d07bfd4e9981eefc7864b2608138df3f [2025-02-05 16:34:00,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:34:00,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:34:00,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:34:00,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:34:00,614 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:34:00,615 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:34:01,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92577b2bd/3d9e391d8d4e4df69f514561af274f9d/FLAG6af9229d5 [2025-02-05 16:34:02,335 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:34:02,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:34:02,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92577b2bd/3d9e391d8d4e4df69f514561af274f9d/FLAG6af9229d5 [2025-02-05 16:34:02,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92577b2bd/3d9e391d8d4e4df69f514561af274f9d [2025-02-05 16:34:02,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:34:02,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:34:02,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:34:02,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:34:02,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:34:02,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:34:02" (1/1) ... [2025-02-05 16:34:02,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc478eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:02, skipping insertion in model container [2025-02-05 16:34:02,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:34:02" (1/1) ... [2025-02-05 16:34:02,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:34:02,822 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11900,11913] [2025-02-05 16:34:02,869 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18638,18651] [2025-02-05 16:34:02,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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20836,20849] [2025-02-05 16:34:02,885 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21913,21926] [2025-02-05 16:34:02,901 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25266,25279] [2025-02-05 16:34:02,905 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26346,26359] [2025-02-05 16:34:02,913 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28575,28588] [2025-02-05 16:34:03,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:34:03,242 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:34:03,291 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11900,11913] [2025-02-05 16:34:03,309 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18638,18651] [2025-02-05 16:34:03,359 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20836,20849] [2025-02-05 16:34:03,363 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21913,21926] [2025-02-05 16:34:03,374 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25266,25279] [2025-02-05 16:34:03,377 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26346,26359] [2025-02-05 16:34:03,382 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28575,28588] [2025-02-05 16:34:03,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:34:03,597 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:34:03,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:03 WrapperNode [2025-02-05 16:34:03,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:34:03,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:34:03,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:34:03,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:34:03,606 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:03" (1/1) ... [2025-02-05 16:34:03,660 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:03" (1/1) ... [2025-02-05 16:34:03,853 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7046 [2025-02-05 16:34:03,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:34:03,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:34:03,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:34:03,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:34:03,862 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:03" (1/1) ... [2025-02-05 16:34:03,862 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:03" (1/1) ... [2025-02-05 16:34:03,884 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:03" (1/1) ... [2025-02-05 16:34:03,959 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:03,960 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:03" (1/1) ... [2025-02-05 16:34:03,960 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:03" (1/1) ... [2025-02-05 16:34:04,034 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:03" (1/1) ... [2025-02-05 16:34:04,043 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:03" (1/1) ... [2025-02-05 16:34:04,059 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:03" (1/1) ... [2025-02-05 16:34:04,073 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:03" (1/1) ... [2025-02-05 16:34:04,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:34:04,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:34:04,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:34:04,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:34:04,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:03" (1/1) ... [2025-02-05 16:34:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:34:04,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:34:04,138 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:04,142 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:04,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:34:04,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:34:04,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:34:04,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:34:04,516 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:34:04,519 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:34:07,885 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4462: havoc main_~node4__m4~18#1; [2025-02-05 16:34:07,886 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10672: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~149#1; [2025-02-05 16:34:07,887 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8955: havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~122#1;havoc main_~node4____CPAchecker_TMP_1~27#1; [2025-02-05 16:34:07,887 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4992: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~60#1; [2025-02-05 16:34:07,887 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4200: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:07,887 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:07,887 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10543: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~147#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10015: havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~139#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8562: havoc main_~node4__m4~34#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10148: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~141#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3938: havoc main_~node4__m4~16#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9092: havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~124#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5261: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8300: havoc main_~node3__m3~11#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7772: havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9358: havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~128#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11077: havoc main_~node4__m4~44#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6586: havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~85#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4472: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397: havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-02-05 16:34:07,888 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7908: havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~106#1;havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-02-05 16:34:07,889 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5530: havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~68#1; [2025-02-05 16:34:07,889 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6191: havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~79#1; [2025-02-05 16:34:07,889 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node4__m4~0#1; [2025-02-05 16:34:07,889 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6457: havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~83#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8572: havoc main_~node4____CPAchecker_TMP_0~26#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4608: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7515: havoc main_~node4__m4~30#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3948: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3024: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8045: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~108#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8310: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7253: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L779: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~33#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8708: havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~118#1;havoc main_~node4____CPAchecker_TMP_1~26#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4084: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6991: havoc main_~node4__m4~28#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838: havoc main_~check__tmp~13#1; [2025-02-05 16:34:07,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11087: havoc main_~node4____CPAchecker_TMP_0~36#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4745: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~56#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9768: havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~135#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10429: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~145#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4219: havoc main_~node4__m4~17#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9901: havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~137#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3691: havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11223: havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~158#1;havoc main_~node4____CPAchecker_TMP_1~36#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8845: havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~120#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7525: havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8319: havoc main_~node4__m4~33#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1052: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10830: havoc main_~node4__m4~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7263: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7661: havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~102#1;havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1319: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5944: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~75#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7001: havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6077: havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~77#1; [2025-02-05 16:34:07,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6343: havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~81#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4229: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3701: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1455: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5287: havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~64#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7137: havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7798: havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~104#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1194: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7272: havoc main_~node4__m4~29#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8329: havoc main_~node4____CPAchecker_TMP_0~25#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3837: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6744: havoc main_~node4__m4~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-02-05 16:34:07,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10840: havoc main_~node4____CPAchecker_TMP_0~35#1; [2025-02-05 16:34:07,894 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4498: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~52#1; [2025-02-05 16:34:07,894 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5159: havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~63#1; [2025-02-05 16:34:07,894 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3444: havoc main_~node4__m4~14#1; [2025-02-05 16:34:07,894 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9654: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~133#1; [2025-02-05 16:34:07,894 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8465: havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~114#1;havoc main_~node4____CPAchecker_TMP_1~25#1; [2025-02-05 16:34:07,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10976: havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~154#1;havoc main_~node4____CPAchecker_TMP_1~35#1; [2025-02-05 16:34:07,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8598: havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~116#1; [2025-02-05 16:34:07,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9259: havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~127#1; [2025-02-05 16:34:07,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3974: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~44#1; [2025-02-05 16:34:07,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3182: havoc main_~node3__m3~6#1; [2025-02-05 16:34:07,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9525: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~131#1; [2025-02-05 16:34:07,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10583: havoc main_~node4__m4~42#1; [2025-02-05 16:34:07,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L807: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11113: havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~156#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7282: havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10321: havoc main_~node3__m3~13#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6754: havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5697: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~71#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830: havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~73#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1602: havoc main_~node2__m2~3#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10059: havoc main_~node4__m4~40#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3454: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-02-05 16:34:07,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7418: havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~98#1;havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6890: havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2530: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7551: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~100#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8212: havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~111#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3192: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3590: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6497: havoc main_~node4__m4~26#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10593: havoc main_~node4____CPAchecker_TMP_0~34#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4912: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~59#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7027: havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~92#1; [2025-02-05 16:34:07,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5045: havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~61#1; [2025-02-05 16:34:07,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc main_~node2__m2~2#1; [2025-02-05 16:34:07,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10331: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-02-05 16:34:07,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6235: havoc main_~node3__m3~9#1; [2025-02-05 16:34:07,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10729: havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~150#1;havoc main_~node4____CPAchecker_TMP_1~34#1; [2025-02-05 16:34:07,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4255: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~48#1; [2025-02-05 16:34:07,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: havoc main_~node4____CPAchecker_TMP_0~32#1; [2025-02-05 16:34:07,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9012: havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~123#1; [2025-02-05 16:34:07,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~40#1; [2025-02-05 16:34:07,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2935: havoc main_~node4__m4~12#1; [2025-02-05 16:34:07,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9145: havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~125#1; [2025-02-05 16:34:07,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L426: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:34:07,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9411: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~129#1; [2025-02-05 16:34:07,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: havoc main_~node4__m4~13#1; [2025-02-05 16:34:07,900 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8355: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~112#1; [2025-02-05 16:34:07,900 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10205: havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~142#1;havoc main_~node4____CPAchecker_TMP_1~32#1; [2025-02-05 16:34:07,900 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2013: havoc main_~check__tmp~15#1; [2025-02-05 16:34:07,900 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10866: havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~152#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6507: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619: havoc main_~node3__m3~4#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5583: havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~69#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1487: havoc main_~check__tmp~9#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10340: havoc main_~node4__m4~41#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9812: havoc main_~node4__m4~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6245: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6643: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5454: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~67#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7965: havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~107#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8098: havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~109#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2945: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~55#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7308: havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~96#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4798: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~57#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6780: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~88#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5988: havoc main_~node4__m4~24#1; [2025-02-05 16:34:07,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node3__m3~2#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6254: havoc main_~node4__m4~25#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10350: havoc main_~node4____CPAchecker_TMP_0~33#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8765: havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~119#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9822: havoc main_~node4____CPAchecker_TMP_0~31#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3480: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~36#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4141: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~47#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8898: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~121#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10486: havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~146#1;havoc main_~node4____CPAchecker_TMP_1~33#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9958: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~138#1;havoc main_~node4____CPAchecker_TMP_1~31#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10619: havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~148#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1370: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11280: havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~159#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636: havoc main_~node4__m4~6#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9565: havoc main_~node4__m4~38#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1109: havoc main_~node4__m4~3#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: havoc main_~node4__m4~7#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10095: havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~140#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node2__m2~1#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6264: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9303: havoc main_~node3__m3~12#1; [2025-02-05 16:34:07,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7718: havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~103#1; [2025-02-05 16:34:07,903 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L319: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:34:07,903 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5340: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~65#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7851: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~105#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6134: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6400: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4551: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~53#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6533: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~84#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7194: havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~95#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5212: havoc main_~node2__m2~4#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2834: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5741: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-02-05 16:34:07,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L985: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L721: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: havoc main_~node4__m4~2#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4422: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~51#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9575: havoc main_~node4____CPAchecker_TMP_0~30#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3894: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~43#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8651: havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~117#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2441: havoc main_~node4__m4~10#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4027: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~45#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9313: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2971: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8522: havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~115#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9711: havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~134#1;havoc main_~node4____CPAchecker_TMP_1~30#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3237: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~32#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11033: havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~155#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11166: havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~157#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc main_~node4__m4~20#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5222: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5751: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10376: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~144#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9848: havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~136#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: havoc main_~node3__m3~1#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9056: havoc main_~node4__m4~36#1; [2025-02-05 16:34:07,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7604: havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~101#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9322: havoc main_~node4__m4~37#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5887: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L339: havoc main_~node2__m2~0#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475: havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~99#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~91#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5494: havoc main_~node4__m4~22#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4966: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7080: havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~93#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: havoc main_~node3__m3~5#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~76#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1268: havoc main_~node3__m3~3#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5232: havoc main_~node3__m3~8#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3647: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~39#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6290: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~80#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4308: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~49#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3780: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~41#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5102: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-02-05 16:34:07,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9066: havoc main_~node4____CPAchecker_TMP_0~28#1; [2025-02-05 16:34:07,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8009: havoc main_~node4__m4~32#1; [2025-02-05 16:34:07,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-05 16:34:07,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9332: havoc main_~node4____CPAchecker_TMP_0~29#1; [2025-02-05 16:34:07,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10786: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~151#1; [2025-02-05 16:34:07,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8408: havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~113#1; [2025-02-05 16:34:07,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1670: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:34:07,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4709: havoc main_~node4__m4~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-02-05 16:34:07,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10919: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~153#1; [2025-02-05 16:34:07,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9202: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~126#1;havoc main_~node4____CPAchecker_TMP_1~28#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1143: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9468: havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~130#1;havoc main_~node4____CPAchecker_TMP_1~29#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5504: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc main_~node4__m4~1#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9601: havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~132#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8280: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10262: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~143#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8809: havoc main_~node4__m4~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5242: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5640: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8019: havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6700: havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~87#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7361: havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~97#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4719: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6833: havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~89#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: havoc main_~node3__m3~0#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8155: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~110#1;havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1945: havoc main_~node4__m4~8#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5777: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~72#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1285: havoc main_~node4__m4~4#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~37#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1419: havoc main_~node4__m4~5#1; [2025-02-05 16:34:07,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2344: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5251: havoc main_~node4__m4~21#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8290: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4855: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8819: havoc main_~node4____CPAchecker_TMP_0~27#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7762: havoc main_~node4__m4~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3138: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L893: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:07,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3404: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~35#1; [2025-02-05 16:34:08,206 INFO L? ?]: Removed 1112 outVars from TransFormulas that were not future-live. [2025-02-05 16:34:08,206 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:34:08,259 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:34:08,260 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:34:08,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:34:08 BoogieIcfgContainer [2025-02-05 16:34:08,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:34:08,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:34:08,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:34:08,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:34:08,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:34:02" (1/3) ... [2025-02-05 16:34:08,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b22d5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:34:08, skipping insertion in model container [2025-02-05 16:34:08,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:03" (2/3) ... [2025-02-05 16:34:08,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b22d5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:34:08, skipping insertion in model container [2025-02-05 16:34:08,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:34:08" (3/3) ... [2025-02-05 16:34:08,271 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:34:08,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:34:08,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1102 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-02-05 16:34:08,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:34:08,406 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;@69b5c6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:34:08,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-05 16:34:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 1102 states, 1094 states have (on average 1.8875685557586837) internal successors, (2065), 1101 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call 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:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:34:08,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:08,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:08,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:08,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1880454602, now seen corresponding path program 1 times [2025-02-05 16:34:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:08,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746027954] [2025-02-05 16:34:08,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:08,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:34:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:34:08,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:08,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:09,021 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:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746027954] [2025-02-05 16:34:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746027954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447769690] [2025-02-05 16:34:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:09,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:09,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:09,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:09,053 INFO L87 Difference]: Start difference. First operand has 1102 states, 1094 states have (on average 1.8875685557586837) internal successors, (2065), 1101 states have internal predecessors, (2065), 0 states have call successors, (0), 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 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:09,339 INFO L93 Difference]: Finished difference Result 1455 states and 2640 transitions. [2025-02-05 16:34:09,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:09,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:34:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:09,365 INFO L225 Difference]: With dead ends: 1455 [2025-02-05 16:34:09,365 INFO L226 Difference]: Without dead ends: 1281 [2025-02-05 16:34:09,369 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:34:09,375 INFO L435 NwaCegarLoop]: 2050 mSDtfsCounter, 966 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 3320 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:09,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 3320 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-02-05 16:34:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1273. [2025-02-05 16:34:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1266 states have (on average 1.319905213270142) internal successors, (1671), 1272 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call 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:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1671 transitions. [2025-02-05 16:34:09,486 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1671 transitions. Word has length 63 [2025-02-05 16:34:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:09,487 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1671 transitions. [2025-02-05 16:34:09,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1671 transitions. [2025-02-05 16:34:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:34:09,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:09,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:09,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:34:09,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 775252650, now seen corresponding path program 1 times [2025-02-05 16:34:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:09,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214553610] [2025-02-05 16:34:09,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:09,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:34:09,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:34:09,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:09,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:09,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214553610] [2025-02-05 16:34:09,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214553610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:09,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:09,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:09,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443260733] [2025-02-05 16:34:09,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:09,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:09,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:09,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:09,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:09,855 INFO L87 Difference]: Start difference. First operand 1273 states and 1671 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:10,522 INFO L93 Difference]: Finished difference Result 2247 states and 3047 transitions. [2025-02-05 16:34:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:10,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:34:10,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:10,531 INFO L225 Difference]: With dead ends: 2247 [2025-02-05 16:34:10,531 INFO L226 Difference]: Without dead ends: 1282 [2025-02-05 16:34:10,536 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:34:10,537 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 3659 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3659 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:10,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3659 Valid, 830 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:34:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2025-02-05 16:34:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1274. [2025-02-05 16:34:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1267 states have (on average 1.3749013417521705) internal successors, (1742), 1273 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call 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:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1742 transitions. [2025-02-05 16:34:10,575 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1742 transitions. Word has length 63 [2025-02-05 16:34:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:10,575 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1742 transitions. [2025-02-05 16:34:10,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1742 transitions. [2025-02-05 16:34:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:34:10,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:10,578 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:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:34:10,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:10,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1858727269, now seen corresponding path program 1 times [2025-02-05 16:34:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830243034] [2025-02-05 16:34:10,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:10,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:34:10,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:34:10,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:10,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:10,824 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:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:10,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830243034] [2025-02-05 16:34:10,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830243034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:10,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:10,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972740453] [2025-02-05 16:34:10,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:10,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:10,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:10,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:10,826 INFO L87 Difference]: Start difference. First operand 1274 states and 1742 transitions. 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:34:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:11,461 INFO L93 Difference]: Finished difference Result 2260 states and 3150 transitions. [2025-02-05 16:34:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:11,462 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:34:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:11,468 INFO L225 Difference]: With dead ends: 2260 [2025-02-05 16:34:11,469 INFO L226 Difference]: Without dead ends: 1400 [2025-02-05 16:34:11,470 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:34:11,473 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 3055 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:11,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3055 Valid, 691 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:34:11,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-02-05 16:34:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1390. [2025-02-05 16:34:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1383 states have (on average 1.3694866232827188) internal successors, (1894), 1389 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call 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:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1894 transitions. [2025-02-05 16:34:11,520 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1894 transitions. Word has length 64 [2025-02-05 16:34:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:11,520 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1894 transitions. [2025-02-05 16:34:11,520 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:34:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1894 transitions. [2025-02-05 16:34:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:34:11,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:11,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:11,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:34:11,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:11,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash -961380577, now seen corresponding path program 1 times [2025-02-05 16:34:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188778797] [2025-02-05 16:34:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:11,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:34:11,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:34:11,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:11,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:11,733 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:11,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:11,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188778797] [2025-02-05 16:34:11,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188778797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:11,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:11,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966825896] [2025-02-05 16:34:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:11,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:11,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:11,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:11,736 INFO L87 Difference]: Start difference. First operand 1390 states and 1894 transitions. 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:34:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:12,202 INFO L93 Difference]: Finished difference Result 3069 states and 4332 transitions. [2025-02-05 16:34:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:12,202 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:34:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:12,210 INFO L225 Difference]: With dead ends: 3069 [2025-02-05 16:34:12,211 INFO L226 Difference]: Without dead ends: 1883 [2025-02-05 16:34:12,215 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:34:12,216 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 2720 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2720 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:12,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2720 Valid, 642 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:34:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2025-02-05 16:34:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1875. [2025-02-05 16:34:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1868 states have (on average 1.4218415417558887) internal successors, (2656), 1874 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call 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:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2656 transitions. [2025-02-05 16:34:12,265 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2656 transitions. Word has length 64 [2025-02-05 16:34:12,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:12,265 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2656 transitions. [2025-02-05 16:34:12,266 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:34:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2656 transitions. [2025-02-05 16:34:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:34:12,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:12,269 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:34:12,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:34:12,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:12,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash -144419334, now seen corresponding path program 1 times [2025-02-05 16:34:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693690865] [2025-02-05 16:34:12,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:12,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:12,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:34:12,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:34:12,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:12,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:12,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693690865] [2025-02-05 16:34:12,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693690865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:12,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:12,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522532338] [2025-02-05 16:34:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:12,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:12,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:12,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:12,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:12,384 INFO L87 Difference]: Start difference. First operand 1875 states and 2656 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:34:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:12,437 INFO L93 Difference]: Finished difference Result 3902 states and 5618 transitions. [2025-02-05 16:34:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:34:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:12,448 INFO L225 Difference]: With dead ends: 3902 [2025-02-05 16:34:12,449 INFO L226 Difference]: Without dead ends: 2612 [2025-02-05 16:34:12,451 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:34:12,452 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 584 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:12,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1525 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2025-02-05 16:34:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2598. [2025-02-05 16:34:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2591 states have (on average 1.4064067927441142) internal successors, (3644), 2597 states have internal predecessors, (3644), 0 states have call successors, (0), 0 states have call 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:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3644 transitions. [2025-02-05 16:34:12,548 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3644 transitions. Word has length 65 [2025-02-05 16:34:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:12,548 INFO L471 AbstractCegarLoop]: Abstraction has 2598 states and 3644 transitions. [2025-02-05 16:34:12,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:34:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3644 transitions. [2025-02-05 16:34:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:34:12,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:12,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:12,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:34:12,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:12,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:12,554 INFO L85 PathProgramCache]: Analyzing trace with hash 289907694, now seen corresponding path program 1 times [2025-02-05 16:34:12,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:12,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860951628] [2025-02-05 16:34:12,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:12,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:12,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:34:12,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:34:12,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:12,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:12,653 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:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860951628] [2025-02-05 16:34:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860951628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:12,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:12,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089964729] [2025-02-05 16:34:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:12,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:12,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:12,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:12,655 INFO L87 Difference]: Start difference. First operand 2598 states and 3644 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:34:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:12,712 INFO L93 Difference]: Finished difference Result 6515 states and 9299 transitions. [2025-02-05 16:34:12,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:12,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:34:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:12,731 INFO L225 Difference]: With dead ends: 6515 [2025-02-05 16:34:12,731 INFO L226 Difference]: Without dead ends: 4449 [2025-02-05 16:34:12,736 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:34:12,736 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 593 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:12,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1534 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4449 states. [2025-02-05 16:34:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4449 to 4432. [2025-02-05 16:34:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 4425 states have (on average 1.4056497175141243) internal successors, (6220), 4431 states have internal predecessors, (6220), 0 states have call successors, (0), 0 states have call 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:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 6220 transitions. [2025-02-05 16:34:12,847 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 6220 transitions. Word has length 65 [2025-02-05 16:34:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:12,847 INFO L471 AbstractCegarLoop]: Abstraction has 4432 states and 6220 transitions. [2025-02-05 16:34:12,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:34:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 6220 transitions. [2025-02-05 16:34:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:34:12,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:12,853 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:34:12,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:34:12,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:12,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -179470074, now seen corresponding path program 1 times [2025-02-05 16:34:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:12,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39936466] [2025-02-05 16:34:12,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:12,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:12,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:34:12,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:34:12,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:12,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:13,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:34:13,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39936466] [2025-02-05 16:34:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39936466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21027853] [2025-02-05 16:34:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:13,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:13,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:13,004 INFO L87 Difference]: Start difference. First operand 4432 states and 6220 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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:34:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:13,508 INFO L93 Difference]: Finished difference Result 11071 states and 15834 transitions. [2025-02-05 16:34:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:13,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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:34:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:13,537 INFO L225 Difference]: With dead ends: 11071 [2025-02-05 16:34:13,537 INFO L226 Difference]: Without dead ends: 7075 [2025-02-05 16:34:13,544 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:34:13,544 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 2406 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:13,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 580 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:34:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2025-02-05 16:34:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 7067. [2025-02-05 16:34:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7067 states, 7060 states have (on average 1.4215297450424929) internal successors, (10036), 7066 states have internal predecessors, (10036), 0 states have call successors, (0), 0 states have call 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:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 10036 transitions. [2025-02-05 16:34:13,727 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 10036 transitions. Word has length 66 [2025-02-05 16:34:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:13,728 INFO L471 AbstractCegarLoop]: Abstraction has 7067 states and 10036 transitions. [2025-02-05 16:34:13,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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:34:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 10036 transitions. [2025-02-05 16:34:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:34:13,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:13,733 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:34:13,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:34:13,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:13,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1620391163, now seen corresponding path program 1 times [2025-02-05 16:34:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:13,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981122222] [2025-02-05 16:34:13,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:13,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:13,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:34:13,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:34:13,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:13,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:13,834 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:13,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:13,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981122222] [2025-02-05 16:34:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981122222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:13,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:13,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796538972] [2025-02-05 16:34:13,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:13,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:13,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:13,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:13,837 INFO L87 Difference]: Start difference. First operand 7067 states and 10036 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:13,932 INFO L93 Difference]: Finished difference Result 15209 states and 21843 transitions. [2025-02-05 16:34:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:13,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:34:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:13,968 INFO L225 Difference]: With dead ends: 15209 [2025-02-05 16:34:13,969 INFO L226 Difference]: Without dead ends: 9563 [2025-02-05 16:34:13,979 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:34:13,979 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 400 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:13,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1181 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9563 states. [2025-02-05 16:34:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9563 to 9519. [2025-02-05 16:34:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9519 states, 9512 states have (on average 1.403174936921783) internal successors, (13347), 9518 states have internal predecessors, (13347), 0 states have call successors, (0), 0 states have call 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:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9519 states to 9519 states and 13347 transitions. [2025-02-05 16:34:14,228 INFO L78 Accepts]: Start accepts. Automaton has 9519 states and 13347 transitions. Word has length 66 [2025-02-05 16:34:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:14,228 INFO L471 AbstractCegarLoop]: Abstraction has 9519 states and 13347 transitions. [2025-02-05 16:34:14,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 9519 states and 13347 transitions. [2025-02-05 16:34:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:34:14,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:14,235 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:34:14,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:34:14,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:14,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash -859930582, now seen corresponding path program 1 times [2025-02-05 16:34:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:14,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288490607] [2025-02-05 16:34:14,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:14,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:34:14,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:34:14,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:14,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:14,439 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:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:14,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288490607] [2025-02-05 16:34:14,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288490607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:14,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:14,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988356046] [2025-02-05 16:34:14,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:14,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:14,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:14,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:14,442 INFO L87 Difference]: Start difference. First operand 9519 states and 13347 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:15,177 INFO L93 Difference]: Finished difference Result 26693 states and 38021 transitions. [2025-02-05 16:34:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:15,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:15,334 INFO L225 Difference]: With dead ends: 26693 [2025-02-05 16:34:15,334 INFO L226 Difference]: Without dead ends: 23150 [2025-02-05 16:34:15,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:15,343 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 3212 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3212 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:15,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3212 Valid, 1116 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:34:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23150 states. [2025-02-05 16:34:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23150 to 9587. [2025-02-05 16:34:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9587 states, 9580 states have (on average 1.4024008350730688) internal successors, (13435), 9586 states have internal predecessors, (13435), 0 states have call successors, (0), 0 states have call 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:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9587 states to 9587 states and 13435 transitions. [2025-02-05 16:34:15,701 INFO L78 Accepts]: Start accepts. Automaton has 9587 states and 13435 transitions. Word has length 67 [2025-02-05 16:34:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:15,701 INFO L471 AbstractCegarLoop]: Abstraction has 9587 states and 13435 transitions. [2025-02-05 16:34:15,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 13435 transitions. [2025-02-05 16:34:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:34:15,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:15,709 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:34:15,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:34:15,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:15,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 91317850, now seen corresponding path program 1 times [2025-02-05 16:34:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:15,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425672966] [2025-02-05 16:34:15,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:15,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:34:15,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:34:15,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:15,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:15,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:34:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425672966] [2025-02-05 16:34:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425672966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861430090] [2025-02-05 16:34:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:15,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:15,917 INFO L87 Difference]: Start difference. First operand 9587 states and 13435 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:16,670 INFO L93 Difference]: Finished difference Result 25330 states and 36055 transitions. [2025-02-05 16:34:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:16,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:16,719 INFO L225 Difference]: With dead ends: 25330 [2025-02-05 16:34:16,719 INFO L226 Difference]: Without dead ends: 20832 [2025-02-05 16:34:16,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:16,733 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 3116 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3116 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:16,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3116 Valid, 1098 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:34:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20832 states. [2025-02-05 16:34:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20832 to 9743. [2025-02-05 16:34:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9743 states, 9736 states have (on average 1.401088742810189) internal successors, (13641), 9742 states have internal predecessors, (13641), 0 states have call successors, (0), 0 states have call 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:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9743 states to 9743 states and 13641 transitions. [2025-02-05 16:34:17,069 INFO L78 Accepts]: Start accepts. Automaton has 9743 states and 13641 transitions. Word has length 67 [2025-02-05 16:34:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:17,069 INFO L471 AbstractCegarLoop]: Abstraction has 9743 states and 13641 transitions. [2025-02-05 16:34:17,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9743 states and 13641 transitions. [2025-02-05 16:34:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:34:17,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:17,078 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:34:17,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:34:17,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:17,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2026207873, now seen corresponding path program 1 times [2025-02-05 16:34:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42028447] [2025-02-05 16:34:17,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:17,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:34:17,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:34:17,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:17,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:17,261 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:17,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42028447] [2025-02-05 16:34:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42028447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:17,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:17,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:17,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846842353] [2025-02-05 16:34:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:17,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:17,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:17,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:17,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:17,265 INFO L87 Difference]: Start difference. First operand 9743 states and 13641 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:17,879 INFO L93 Difference]: Finished difference Result 20478 states and 29042 transitions. [2025-02-05 16:34:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:17,916 INFO L225 Difference]: With dead ends: 20478 [2025-02-05 16:34:17,916 INFO L226 Difference]: Without dead ends: 15881 [2025-02-05 16:34:17,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:17,928 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2868 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:17,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2868 Valid, 1054 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:34:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2025-02-05 16:34:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 9778. [2025-02-05 16:34:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9778 states, 9771 states have (on average 1.4006754682222904) internal successors, (13686), 9777 states have internal predecessors, (13686), 0 states have call successors, (0), 0 states have call 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:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9778 states to 9778 states and 13686 transitions. [2025-02-05 16:34:18,188 INFO L78 Accepts]: Start accepts. Automaton has 9778 states and 13686 transitions. Word has length 67 [2025-02-05 16:34:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:18,188 INFO L471 AbstractCegarLoop]: Abstraction has 9778 states and 13686 transitions. [2025-02-05 16:34:18,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 9778 states and 13686 transitions. [2025-02-05 16:34:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:34:18,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:18,198 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:34:18,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:34:18,198 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:34:18,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash -851503613, now seen corresponding path program 1 times [2025-02-05 16:34:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909757092] [2025-02-05 16:34:18,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:18,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:34:18,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:34:18,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:18,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:18,396 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:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909757092] [2025-02-05 16:34:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909757092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624849320] [2025-02-05 16:34:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:18,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:18,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:18,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:18,398 INFO L87 Difference]: Start difference. First operand 9778 states and 13686 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:19,216 INFO L93 Difference]: Finished difference Result 22811 states and 32396 transitions. [2025-02-05 16:34:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:19,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:19,253 INFO L225 Difference]: With dead ends: 22811 [2025-02-05 16:34:19,253 INFO L226 Difference]: Without dead ends: 18679 [2025-02-05 16:34:19,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:19,268 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 3039 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:19,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 1079 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:34:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18679 states. [2025-02-05 16:34:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18679 to 9849. [2025-02-05 16:34:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9849 states, 9842 states have (on average 1.4006299532615323) internal successors, (13785), 9848 states have internal predecessors, (13785), 0 states have call successors, (0), 0 states have call 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:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 13785 transitions. [2025-02-05 16:34:19,574 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 13785 transitions. Word has length 67 [2025-02-05 16:34:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:19,574 INFO L471 AbstractCegarLoop]: Abstraction has 9849 states and 13785 transitions. [2025-02-05 16:34:19,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:34:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 13785 transitions. [2025-02-05 16:34:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:34:19,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:19,585 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:34:19,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:34:19,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:19,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1232705370, now seen corresponding path program 1 times [2025-02-05 16:34:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410959009] [2025-02-05 16:34:19,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:34:19,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:34:19,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:19,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:20,032 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:20,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410959009] [2025-02-05 16:34:20,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410959009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:20,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:20,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:34:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664643468] [2025-02-05 16:34:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:20,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:34:20,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:20,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:34:20,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:34:20,034 INFO L87 Difference]: Start difference. First operand 9849 states and 13785 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 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:34:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:20,948 INFO L93 Difference]: Finished difference Result 25021 states and 35824 transitions. [2025-02-05 16:34:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:34:20,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 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:34:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:20,983 INFO L225 Difference]: With dead ends: 25021 [2025-02-05 16:34:20,983 INFO L226 Difference]: Without dead ends: 18104 [2025-02-05 16:34:20,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:34:20,998 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 2293 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:20,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 1586 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:34:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2025-02-05 16:34:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 9543. [2025-02-05 16:34:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9543 states, 9536 states have (on average 1.4001677852348993) internal successors, (13352), 9542 states have internal predecessors, (13352), 0 states have call successors, (0), 0 states have call 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:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9543 states to 9543 states and 13352 transitions. [2025-02-05 16:34:21,228 INFO L78 Accepts]: Start accepts. Automaton has 9543 states and 13352 transitions. Word has length 68 [2025-02-05 16:34:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:21,228 INFO L471 AbstractCegarLoop]: Abstraction has 9543 states and 13352 transitions. [2025-02-05 16:34:21,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 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:34:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 9543 states and 13352 transitions. [2025-02-05 16:34:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:34:21,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:21,235 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:34:21,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:34:21,235 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:34:21,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash 781095791, now seen corresponding path program 1 times [2025-02-05 16:34:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:21,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054739685] [2025-02-05 16:34:21,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:21,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:34:21,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:34:21,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:21,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:21,528 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:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:21,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054739685] [2025-02-05 16:34:21,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054739685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:21,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:21,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:34:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016902488] [2025-02-05 16:34:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:21,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:34:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:21,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:34:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:21,530 INFO L87 Difference]: Start difference. First operand 9543 states and 13352 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:22,429 INFO L93 Difference]: Finished difference Result 20685 states and 29459 transitions. [2025-02-05 16:34:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:34:22,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:22,459 INFO L225 Difference]: With dead ends: 20685 [2025-02-05 16:34:22,459 INFO L226 Difference]: Without dead ends: 14477 [2025-02-05 16:34:22,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:34:22,471 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 2581 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:22,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2581 Valid, 1820 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:34:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14477 states. [2025-02-05 16:34:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14477 to 9531. [2025-02-05 16:34:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9531 states, 9524 states have (on average 1.3995170096598069) internal successors, (13329), 9530 states have internal predecessors, (13329), 0 states have call successors, (0), 0 states have call 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:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9531 states to 9531 states and 13329 transitions. [2025-02-05 16:34:22,648 INFO L78 Accepts]: Start accepts. Automaton has 9531 states and 13329 transitions. Word has length 68 [2025-02-05 16:34:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 9531 states and 13329 transitions. [2025-02-05 16:34:22,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 9531 states and 13329 transitions. [2025-02-05 16:34:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:34:22,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:22,656 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:34:22,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:34:22,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1578892174, now seen corresponding path program 1 times [2025-02-05 16:34:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979803565] [2025-02-05 16:34:22,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:22,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:34:22,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:34:22,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:22,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:23,029 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:23,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:23,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979803565] [2025-02-05 16:34:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979803565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:23,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:34:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530679888] [2025-02-05 16:34:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:34:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:23,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:34:23,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:23,032 INFO L87 Difference]: Start difference. First operand 9531 states and 13329 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:23,881 INFO L93 Difference]: Finished difference Result 20838 states and 29684 transitions. [2025-02-05 16:34:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:34:23,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:23,897 INFO L225 Difference]: With dead ends: 20838 [2025-02-05 16:34:23,897 INFO L226 Difference]: Without dead ends: 14603 [2025-02-05 16:34:23,908 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:34:23,909 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 3559 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3559 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:23,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3559 Valid, 1765 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:34:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2025-02-05 16:34:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 9507. [2025-02-05 16:34:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9507 states, 9500 states have (on average 1.3989473684210527) internal successors, (13290), 9506 states have internal predecessors, (13290), 0 states have call successors, (0), 0 states have call 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:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9507 states to 9507 states and 13290 transitions. [2025-02-05 16:34:24,073 INFO L78 Accepts]: Start accepts. Automaton has 9507 states and 13290 transitions. Word has length 68 [2025-02-05 16:34:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 9507 states and 13290 transitions. [2025-02-05 16:34:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 9507 states and 13290 transitions. [2025-02-05 16:34:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:34:24,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:24,079 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:34:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:34:24,080 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:24,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:24,080 INFO L85 PathProgramCache]: Analyzing trace with hash -875626333, now seen corresponding path program 1 times [2025-02-05 16:34:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115328131] [2025-02-05 16:34:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:24,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:34:24,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:34:24,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:24,376 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:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115328131] [2025-02-05 16:34:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115328131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:34:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590734492] [2025-02-05 16:34:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:24,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:34:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:24,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:34:24,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:24,380 INFO L87 Difference]: Start difference. First operand 9507 states and 13290 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:25,214 INFO L93 Difference]: Finished difference Result 19467 states and 27690 transitions. [2025-02-05 16:34:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:34:25,215 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:25,232 INFO L225 Difference]: With dead ends: 19467 [2025-02-05 16:34:25,232 INFO L226 Difference]: Without dead ends: 13008 [2025-02-05 16:34:25,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:34:25,243 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2526 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2526 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:25,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2526 Valid, 1756 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:34:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13008 states. [2025-02-05 16:34:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13008 to 9372. [2025-02-05 16:34:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9372 states, 9365 states have (on average 1.39893219434063) internal successors, (13101), 9371 states have internal predecessors, (13101), 0 states have call successors, (0), 0 states have call 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:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 13101 transitions. [2025-02-05 16:34:25,397 INFO L78 Accepts]: Start accepts. Automaton has 9372 states and 13101 transitions. Word has length 68 [2025-02-05 16:34:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:25,398 INFO L471 AbstractCegarLoop]: Abstraction has 9372 states and 13101 transitions. [2025-02-05 16:34:25,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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:34:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9372 states and 13101 transitions. [2025-02-05 16:34:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:25,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:25,403 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:34:25,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:34:25,404 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:34:25,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash 805127769, now seen corresponding path program 1 times [2025-02-05 16:34:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167506897] [2025-02-05 16:34:25,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:25,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:25,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:25,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:25,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:26,174 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:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167506897] [2025-02-05 16:34:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167506897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:34:26,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893859688] [2025-02-05 16:34:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:34:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:26,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:34:26,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:34:26,176 INFO L87 Difference]: Start difference. First operand 9372 states and 13101 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:34:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:27,705 INFO L93 Difference]: Finished difference Result 30356 states and 43550 transitions. [2025-02-05 16:34:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:34:27,705 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:34:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:27,753 INFO L225 Difference]: With dead ends: 30356 [2025-02-05 16:34:27,753 INFO L226 Difference]: Without dead ends: 24151 [2025-02-05 16:34:27,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:34:27,770 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 4910 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4910 SdHoareTripleChecker+Valid, 3857 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:27,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4910 Valid, 3857 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:34:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24151 states. [2025-02-05 16:34:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24151 to 9352. [2025-02-05 16:34:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9352 states, 9346 states have (on average 1.3978172480205435) internal successors, (13064), 9351 states have internal predecessors, (13064), 0 states have call successors, (0), 0 states have call 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:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9352 states to 9352 states and 13064 transitions. [2025-02-05 16:34:27,996 INFO L78 Accepts]: Start accepts. Automaton has 9352 states and 13064 transitions. Word has length 69 [2025-02-05 16:34:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:27,997 INFO L471 AbstractCegarLoop]: Abstraction has 9352 states and 13064 transitions. [2025-02-05 16:34:27,997 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:34:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 9352 states and 13064 transitions. [2025-02-05 16:34:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:28,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:28,005 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:34:28,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:34:28,005 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:28,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1508672737, now seen corresponding path program 1 times [2025-02-05 16:34:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842856753] [2025-02-05 16:34:28,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:28,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:28,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:28,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:28,574 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:28,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842856753] [2025-02-05 16:34:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842856753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:28,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:28,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:34:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786231728] [2025-02-05 16:34:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:28,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:34:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:28,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:34:28,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:28,576 INFO L87 Difference]: Start difference. First operand 9352 states and 13064 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:34:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:29,311 INFO L93 Difference]: Finished difference Result 20463 states and 29248 transitions. [2025-02-05 16:34:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:34:29,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:34:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:29,331 INFO L225 Difference]: With dead ends: 20463 [2025-02-05 16:34:29,332 INFO L226 Difference]: Without dead ends: 13887 [2025-02-05 16:34:29,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:34:29,342 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 3157 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3157 SdHoareTripleChecker+Valid, 3420 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:29,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3157 Valid, 3420 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:34:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13887 states. [2025-02-05 16:34:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13887 to 8955. [2025-02-05 16:34:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8955 states, 8951 states have (on average 1.4007373477823706) internal successors, (12538), 8954 states have internal predecessors, (12538), 0 states have call successors, (0), 0 states have call 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:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8955 states to 8955 states and 12538 transitions. [2025-02-05 16:34:29,492 INFO L78 Accepts]: Start accepts. Automaton has 8955 states and 12538 transitions. Word has length 69 [2025-02-05 16:34:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:29,492 INFO L471 AbstractCegarLoop]: Abstraction has 8955 states and 12538 transitions. [2025-02-05 16:34:29,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:34:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8955 states and 12538 transitions. [2025-02-05 16:34:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:29,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:29,526 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:34:29,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:34:29,527 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:29,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:29,527 INFO L85 PathProgramCache]: Analyzing trace with hash 141951119, now seen corresponding path program 1 times [2025-02-05 16:34:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:29,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806070705] [2025-02-05 16:34:29,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:29,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:29,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:29,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:29,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:30,114 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:30,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806070705] [2025-02-05 16:34:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806070705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:30,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:30,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:34:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844255282] [2025-02-05 16:34:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:30,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:34:30,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:30,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:34:30,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:30,117 INFO L87 Difference]: Start difference. First operand 8955 states and 12538 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:34:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:30,854 INFO L93 Difference]: Finished difference Result 20048 states and 28693 transitions. [2025-02-05 16:34:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:34:30,855 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:34:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:30,874 INFO L225 Difference]: With dead ends: 20048 [2025-02-05 16:34:30,874 INFO L226 Difference]: Without dead ends: 13778 [2025-02-05 16:34:30,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:34:30,884 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 3476 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3476 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:30,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3476 Valid, 2715 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:34:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2025-02-05 16:34:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 8870. [2025-02-05 16:34:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8870 states, 8867 states have (on average 1.3995714446825307) internal successors, (12410), 8869 states have internal predecessors, (12410), 0 states have call successors, (0), 0 states have call 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:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8870 states to 8870 states and 12410 transitions. [2025-02-05 16:34:31,029 INFO L78 Accepts]: Start accepts. Automaton has 8870 states and 12410 transitions. Word has length 69 [2025-02-05 16:34:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:31,029 INFO L471 AbstractCegarLoop]: Abstraction has 8870 states and 12410 transitions. [2025-02-05 16:34:31,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:34:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8870 states and 12410 transitions. [2025-02-05 16:34:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:31,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:31,035 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:34:31,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:34:31,035 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:31,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1450865665, now seen corresponding path program 1 times [2025-02-05 16:34:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:31,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126191432] [2025-02-05 16:34:31,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:31,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:31,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:31,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:31,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:31,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:31,532 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:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126191432] [2025-02-05 16:34:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126191432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:34:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130872454] [2025-02-05 16:34:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:31,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:31,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:31,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:31,534 INFO L87 Difference]: Start difference. First operand 8870 states and 12410 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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:34:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:32,148 INFO L93 Difference]: Finished difference Result 21492 states and 30825 transitions. [2025-02-05 16:34:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:34:32,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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:34:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:32,169 INFO L225 Difference]: With dead ends: 21492 [2025-02-05 16:34:32,169 INFO L226 Difference]: Without dead ends: 15088 [2025-02-05 16:34:32,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:34:32,181 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 2195 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:32,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 1681 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:34:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15088 states. [2025-02-05 16:34:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15088 to 8669. [2025-02-05 16:34:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8669 states, 8667 states have (on average 1.3992154147917388) internal successors, (12127), 8668 states have internal predecessors, (12127), 0 states have call successors, (0), 0 states have call 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:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8669 states to 8669 states and 12127 transitions. [2025-02-05 16:34:32,335 INFO L78 Accepts]: Start accepts. Automaton has 8669 states and 12127 transitions. Word has length 69 [2025-02-05 16:34:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:32,335 INFO L471 AbstractCegarLoop]: Abstraction has 8669 states and 12127 transitions. [2025-02-05 16:34:32,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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:34:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 8669 states and 12127 transitions. [2025-02-05 16:34:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:34:32,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:32,342 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:34:32,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:34:32,342 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:34:32,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2073457156, now seen corresponding path program 1 times [2025-02-05 16:34:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704085788] [2025-02-05 16:34:32,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:32,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:34:32,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:34:32,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:32,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:32,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:32,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704085788] [2025-02-05 16:34:32,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704085788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:32,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:32,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860617871] [2025-02-05 16:34:32,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:32,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:32,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:32,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:32,420 INFO L87 Difference]: Start difference. First operand 8669 states and 12127 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:34:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:32,550 INFO L93 Difference]: Finished difference Result 17861 states and 25296 transitions. [2025-02-05 16:34:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:32,551 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:34:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:32,570 INFO L225 Difference]: With dead ends: 17861 [2025-02-05 16:34:32,570 INFO L226 Difference]: Without dead ends: 12531 [2025-02-05 16:34:32,580 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:34:32,581 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 380 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:32,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 525 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2025-02-05 16:34:32,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12493. [2025-02-05 16:34:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12493 states, 12492 states have (on average 1.4219500480307397) internal successors, (17763), 12492 states have internal predecessors, (17763), 0 states have call successors, (0), 0 states have call 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:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12493 states to 12493 states and 17763 transitions. [2025-02-05 16:34:32,743 INFO L78 Accepts]: Start accepts. Automaton has 12493 states and 17763 transitions. Word has length 71 [2025-02-05 16:34:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:32,744 INFO L471 AbstractCegarLoop]: Abstraction has 12493 states and 17763 transitions. [2025-02-05 16:34:32,744 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:34:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 12493 states and 17763 transitions. [2025-02-05 16:34:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:34:32,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:32,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:32,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:34:32,758 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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:32,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash -655044574, now seen corresponding path program 1 times [2025-02-05 16:34:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203332654] [2025-02-05 16:34:32,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:34:32,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:34:32,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:32,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:32,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:32,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203332654] [2025-02-05 16:34:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203332654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:32,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:32,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063617300] [2025-02-05 16:34:32,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:32,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:32,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:32,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:32,879 INFO L87 Difference]: Start difference. First operand 12493 states and 17763 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:33,142 INFO L93 Difference]: Finished difference Result 63308 states and 92573 transitions. [2025-02-05 16:34:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:34:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:33,231 INFO L225 Difference]: With dead ends: 63308 [2025-02-05 16:34:33,232 INFO L226 Difference]: Without dead ends: 53145 [2025-02-05 16:34:33,262 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:34:33,263 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 2105 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2105 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:33,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2105 Valid, 1091 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53145 states. [2025-02-05 16:34:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53145 to 22654. [2025-02-05 16:34:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22654 states, 22653 states have (on average 1.4286849423917363) internal successors, (32364), 22653 states have internal predecessors, (32364), 0 states have call successors, (0), 0 states have call 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:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22654 states to 22654 states and 32364 transitions. [2025-02-05 16:34:33,805 INFO L78 Accepts]: Start accepts. Automaton has 22654 states and 32364 transitions. Word has length 84 [2025-02-05 16:34:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:33,805 INFO L471 AbstractCegarLoop]: Abstraction has 22654 states and 32364 transitions. [2025-02-05 16:34:33,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 22654 states and 32364 transitions. [2025-02-05 16:34:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:34:33,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:33,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:33,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:34:33,825 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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:33,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1198039173, now seen corresponding path program 1 times [2025-02-05 16:34:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:33,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347376768] [2025-02-05 16:34:33,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:33,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:34:33,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:34:33,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:33,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:33,973 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:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347376768] [2025-02-05 16:34:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347376768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805649825] [2025-02-05 16:34:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:33,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:33,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:33,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:33,977 INFO L87 Difference]: Start difference. First operand 22654 states and 32364 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:34,260 INFO L93 Difference]: Finished difference Result 38558 states and 55064 transitions. [2025-02-05 16:34:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:34:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:34,301 INFO L225 Difference]: With dead ends: 38558 [2025-02-05 16:34:34,301 INFO L226 Difference]: Without dead ends: 26177 [2025-02-05 16:34:34,322 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:34:34,323 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 886 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:34,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1430 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26177 states. [2025-02-05 16:34:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26177 to 19313. [2025-02-05 16:34:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19313 states, 19312 states have (on average 1.4092792046396023) internal successors, (27216), 19312 states have internal predecessors, (27216), 0 states have call successors, (0), 0 states have call 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:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19313 states to 19313 states and 27216 transitions. [2025-02-05 16:34:34,597 INFO L78 Accepts]: Start accepts. Automaton has 19313 states and 27216 transitions. Word has length 85 [2025-02-05 16:34:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:34,597 INFO L471 AbstractCegarLoop]: Abstraction has 19313 states and 27216 transitions. [2025-02-05 16:34:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 19313 states and 27216 transitions. [2025-02-05 16:34:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:34:34,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:34,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:34,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:34:34,613 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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:34,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2134494609, now seen corresponding path program 1 times [2025-02-05 16:34:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:34,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138308910] [2025-02-05 16:34:34,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:34,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:34:34,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:34:34,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:34,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:34,772 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:34,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:34,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138308910] [2025-02-05 16:34:34,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138308910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:34,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:34,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657418681] [2025-02-05 16:34:34,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:34,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:34,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:34,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:34,775 INFO L87 Difference]: Start difference. First operand 19313 states and 27216 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:34,958 INFO L93 Difference]: Finished difference Result 51449 states and 73270 transitions. [2025-02-05 16:34:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:34,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 16:34:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:35,010 INFO L225 Difference]: With dead ends: 51449 [2025-02-05 16:34:35,010 INFO L226 Difference]: Without dead ends: 34309 [2025-02-05 16:34:35,035 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:34:35,036 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 143 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:35,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 858 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34309 states. [2025-02-05 16:34:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34309 to 31267. [2025-02-05 16:34:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31267 states, 31266 states have (on average 1.413740165035502) internal successors, (44202), 31266 states have internal predecessors, (44202), 0 states have call successors, (0), 0 states have call 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:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31267 states to 31267 states and 44202 transitions. [2025-02-05 16:34:35,444 INFO L78 Accepts]: Start accepts. Automaton has 31267 states and 44202 transitions. Word has length 86 [2025-02-05 16:34:35,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:35,444 INFO L471 AbstractCegarLoop]: Abstraction has 31267 states and 44202 transitions. [2025-02-05 16:34:35,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 31267 states and 44202 transitions. [2025-02-05 16:34:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:34:35,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:35,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:35,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:34:35,456 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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:35,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:35,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1009104974, now seen corresponding path program 1 times [2025-02-05 16:34:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:35,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741258651] [2025-02-05 16:34:35,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:35,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:34:35,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:34:35,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:35,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:35,520 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:35,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:35,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741258651] [2025-02-05 16:34:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741258651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102377506] [2025-02-05 16:34:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:35,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:35,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:35,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:35,522 INFO L87 Difference]: Start difference. First operand 31267 states and 44202 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:35,641 INFO L93 Difference]: Finished difference Result 45336 states and 64079 transitions. [2025-02-05 16:34:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-05 16:34:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:35,685 INFO L225 Difference]: With dead ends: 45336 [2025-02-05 16:34:35,685 INFO L226 Difference]: Without dead ends: 28517 [2025-02-05 16:34:35,705 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:34:35,706 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 242 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:35,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 909 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28517 states. [2025-02-05 16:34:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28517 to 28515. [2025-02-05 16:34:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28515 states, 28514 states have (on average 1.4033807953987516) internal successors, (40016), 28514 states have internal predecessors, (40016), 0 states have call successors, (0), 0 states have call 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:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28515 states to 28515 states and 40016 transitions. [2025-02-05 16:34:36,031 INFO L78 Accepts]: Start accepts. Automaton has 28515 states and 40016 transitions. Word has length 87 [2025-02-05 16:34:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:36,031 INFO L471 AbstractCegarLoop]: Abstraction has 28515 states and 40016 transitions. [2025-02-05 16:34:36,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 28515 states and 40016 transitions. [2025-02-05 16:34:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:34:36,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:36,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:36,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:34:36,044 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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:36,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -257802829, now seen corresponding path program 1 times [2025-02-05 16:34:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291083514] [2025-02-05 16:34:36,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:36,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:34:36,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:34:36,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:36,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:36,210 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:36,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:36,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291083514] [2025-02-05 16:34:36,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291083514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:36,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:36,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:36,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469673646] [2025-02-05 16:34:36,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:36,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:36,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:36,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:36,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:36,213 INFO L87 Difference]: Start difference. First operand 28515 states and 40016 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:36,452 INFO L93 Difference]: Finished difference Result 78479 states and 110714 transitions. [2025-02-05 16:34:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-05 16:34:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:36,544 INFO L225 Difference]: With dead ends: 78479 [2025-02-05 16:34:36,545 INFO L226 Difference]: Without dead ends: 52089 [2025-02-05 16:34:36,581 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:34:36,582 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 130 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:36,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 840 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52089 states. [2025-02-05 16:34:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52089 to 46743. [2025-02-05 16:34:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46743 states, 46742 states have (on average 1.3997689444182961) internal successors, (65428), 46742 states have internal predecessors, (65428), 0 states have call successors, (0), 0 states have call 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:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46743 states to 46743 states and 65428 transitions. [2025-02-05 16:34:37,069 INFO L78 Accepts]: Start accepts. Automaton has 46743 states and 65428 transitions. Word has length 87 [2025-02-05 16:34:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:37,069 INFO L471 AbstractCegarLoop]: Abstraction has 46743 states and 65428 transitions. [2025-02-05 16:34:37,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 46743 states and 65428 transitions. [2025-02-05 16:34:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:34:37,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:37,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:37,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:34:37,081 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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:37,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1783763498, now seen corresponding path program 1 times [2025-02-05 16:34:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895518547] [2025-02-05 16:34:37,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:37,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:34:37,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:34:37,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:37,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:37,149 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:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895518547] [2025-02-05 16:34:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895518547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:37,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001239981] [2025-02-05 16:34:37,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:37,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:37,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:37,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:37,151 INFO L87 Difference]: Start difference. First operand 46743 states and 65428 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:37,292 INFO L93 Difference]: Finished difference Result 58532 states and 81834 transitions. [2025-02-05 16:34:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-05 16:34:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:37,338 INFO L225 Difference]: With dead ends: 58532 [2025-02-05 16:34:37,338 INFO L226 Difference]: Without dead ends: 41616 [2025-02-05 16:34:37,363 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:34:37,363 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 199 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:37,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 884 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41616 states. [2025-02-05 16:34:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41616 to 41614. [2025-02-05 16:34:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41614 states, 41613 states have (on average 1.393987455843126) internal successors, (58008), 41613 states have internal predecessors, (58008), 0 states have call successors, (0), 0 states have call 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:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41614 states to 41614 states and 58008 transitions. [2025-02-05 16:34:37,868 INFO L78 Accepts]: Start accepts. Automaton has 41614 states and 58008 transitions. Word has length 88 [2025-02-05 16:34:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:37,869 INFO L471 AbstractCegarLoop]: Abstraction has 41614 states and 58008 transitions. [2025-02-05 16:34:37,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 41614 states and 58008 transitions. [2025-02-05 16:34:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:34:37,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:37,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:34:37,876 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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:37,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:37,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1694773956, now seen corresponding path program 1 times [2025-02-05 16:34:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:37,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66283399] [2025-02-05 16:34:37,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:37,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:34:37,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:34:37,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:37,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:37,939 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:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:37,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66283399] [2025-02-05 16:34:37,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66283399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:37,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:37,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:37,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149303160] [2025-02-05 16:34:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:37,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:37,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:37,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:37,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:37,941 INFO L87 Difference]: Start difference. First operand 41614 states and 58008 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:38,228 INFO L93 Difference]: Finished difference Result 55941 states and 77717 transitions. [2025-02-05 16:34:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:38,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-05 16:34:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:38,306 INFO L225 Difference]: With dead ends: 55941 [2025-02-05 16:34:38,306 INFO L226 Difference]: Without dead ends: 36101 [2025-02-05 16:34:38,327 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:34:38,328 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 251 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:38,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 961 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36101 states. [2025-02-05 16:34:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36101 to 36099. [2025-02-05 16:34:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36099 states, 36098 states have (on average 1.373954235691728) internal successors, (49597), 36098 states have internal predecessors, (49597), 0 states have call successors, (0), 0 states have call 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:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36099 states to 36099 states and 49597 transitions. [2025-02-05 16:34:38,653 INFO L78 Accepts]: Start accepts. Automaton has 36099 states and 49597 transitions. Word has length 88 [2025-02-05 16:34:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:38,653 INFO L471 AbstractCegarLoop]: Abstraction has 36099 states and 49597 transitions. [2025-02-05 16:34:38,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 36099 states and 49597 transitions. [2025-02-05 16:34:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:34:38,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:38,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:34:38,661 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1528579857, now seen corresponding path program 1 times [2025-02-05 16:34:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412956038] [2025-02-05 16:34:38,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:38,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:34:38,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:34:38,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:38,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:38,793 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:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412956038] [2025-02-05 16:34:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412956038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:38,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:38,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:38,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451691741] [2025-02-05 16:34:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:38,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:38,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:38,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:38,795 INFO L87 Difference]: Start difference. First operand 36099 states and 49597 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:39,167 INFO L93 Difference]: Finished difference Result 101751 states and 140239 transitions. [2025-02-05 16:34:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 16:34:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:39,252 INFO L225 Difference]: With dead ends: 101751 [2025-02-05 16:34:39,252 INFO L226 Difference]: Without dead ends: 67645 [2025-02-05 16:34:39,283 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:34:39,283 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 108 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:39,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 820 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67645 states. [2025-02-05 16:34:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67645 to 63675. [2025-02-05 16:34:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63675 states, 63674 states have (on average 1.3713132518767472) internal successors, (87317), 63674 states have internal predecessors, (87317), 0 states have call successors, (0), 0 states have call 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:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63675 states to 63675 states and 87317 transitions. [2025-02-05 16:34:40,109 INFO L78 Accepts]: Start accepts. Automaton has 63675 states and 87317 transitions. Word has length 89 [2025-02-05 16:34:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:40,109 INFO L471 AbstractCegarLoop]: Abstraction has 63675 states and 87317 transitions. [2025-02-05 16:34:40,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 63675 states and 87317 transitions. [2025-02-05 16:34:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:34:40,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:40,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:40,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:34:40,118 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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:40,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:40,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2109092762, now seen corresponding path program 1 times [2025-02-05 16:34:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:40,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663467691] [2025-02-05 16:34:40,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:40,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:34:40,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:34:40,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:40,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:40,205 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:40,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:40,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663467691] [2025-02-05 16:34:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663467691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:40,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432368651] [2025-02-05 16:34:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:40,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:40,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:40,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:40,207 INFO L87 Difference]: Start difference. First operand 63675 states and 87317 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:40,628 INFO L93 Difference]: Finished difference Result 179727 states and 246023 transitions. [2025-02-05 16:34:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 16:34:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:40,803 INFO L225 Difference]: With dead ends: 179727 [2025-02-05 16:34:40,803 INFO L226 Difference]: Without dead ends: 118045 [2025-02-05 16:34:40,863 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:34:40,863 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 346 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:40,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 590 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118045 states. [2025-02-05 16:34:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118045 to 116571. [2025-02-05 16:34:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116571 states, 116570 states have (on average 1.3436475937205112) internal successors, (156629), 116570 states have internal predecessors, (156629), 0 states have call successors, (0), 0 states have call 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:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116571 states to 116571 states and 156629 transitions. [2025-02-05 16:34:42,544 INFO L78 Accepts]: Start accepts. Automaton has 116571 states and 156629 transitions. Word has length 90 [2025-02-05 16:34:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:42,544 INFO L471 AbstractCegarLoop]: Abstraction has 116571 states and 156629 transitions. [2025-02-05 16:34:42,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 116571 states and 156629 transitions. [2025-02-05 16:34:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:34:42,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:42,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:42,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:34:42,554 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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:42,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:42,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2123834920, now seen corresponding path program 1 times [2025-02-05 16:34:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:42,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024345966] [2025-02-05 16:34:42,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:42,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:42,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:34:42,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:34:42,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:42,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:42,657 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:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024345966] [2025-02-05 16:34:42,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024345966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:42,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:42,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171013445] [2025-02-05 16:34:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:42,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:42,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:42,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:42,659 INFO L87 Difference]: Start difference. First operand 116571 states and 156629 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:43,990 INFO L93 Difference]: Finished difference Result 300847 states and 404999 transitions. [2025-02-05 16:34:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:43,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 16:34:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:44,426 INFO L225 Difference]: With dead ends: 300847 [2025-02-05 16:34:44,426 INFO L226 Difference]: Without dead ends: 186269 [2025-02-05 16:34:44,521 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:34:44,522 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 152 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:44,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 876 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186269 states. [2025-02-05 16:34:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186269 to 167387. [2025-02-05 16:34:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167387 states, 167386 states have (on average 1.3337614854288888) internal successors, (223253), 167386 states have internal predecessors, (223253), 0 states have call successors, (0), 0 states have call 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:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167387 states to 167387 states and 223253 transitions. [2025-02-05 16:34:47,669 INFO L78 Accepts]: Start accepts. Automaton has 167387 states and 223253 transitions. Word has length 90 [2025-02-05 16:34:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:47,669 INFO L471 AbstractCegarLoop]: Abstraction has 167387 states and 223253 transitions. [2025-02-05 16:34:47,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 167387 states and 223253 transitions. [2025-02-05 16:34:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:34:47,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:47,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:47,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:34:47,680 INFO L396 AbstractCegarLoop]: === Iteration 32 === 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:47,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash -835085174, now seen corresponding path program 1 times [2025-02-05 16:34:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878635950] [2025-02-05 16:34:47,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:47,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:34:47,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:34:47,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:47,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:48,236 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:48,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:48,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878635950] [2025-02-05 16:34:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878635950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:48,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:48,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102766099] [2025-02-05 16:34:48,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:48,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:48,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:48,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:48,238 INFO L87 Difference]: Start difference. First operand 167387 states and 223253 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:49,017 INFO L93 Difference]: Finished difference Result 174013 states and 232086 transitions. [2025-02-05 16:34:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:49,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 16:34:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:49,465 INFO L225 Difference]: With dead ends: 174013 [2025-02-05 16:34:49,465 INFO L226 Difference]: Without dead ends: 174011 [2025-02-05 16:34:49,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:49,516 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 0 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:49,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2095 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174011 states. [2025-02-05 16:34:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174011 to 174011. [2025-02-05 16:34:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174011 states, 174010 states have (on average 1.30836733521062) internal successors, (227669), 174010 states have internal predecessors, (227669), 0 states have call successors, (0), 0 states have call 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:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174011 states to 174011 states and 227669 transitions. [2025-02-05 16:34:51,852 INFO L78 Accepts]: Start accepts. Automaton has 174011 states and 227669 transitions. Word has length 91 [2025-02-05 16:34:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:51,852 INFO L471 AbstractCegarLoop]: Abstraction has 174011 states and 227669 transitions. [2025-02-05 16:34:51,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 174011 states and 227669 transitions. [2025-02-05 16:34:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:34:51,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:51,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:51,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:34:51,860 INFO L396 AbstractCegarLoop]: === Iteration 33 === 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:51,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1259670590, now seen corresponding path program 1 times [2025-02-05 16:34:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248615095] [2025-02-05 16:34:51,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:51,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:34:51,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:34:51,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:51,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:52,029 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:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248615095] [2025-02-05 16:34:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248615095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:52,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:52,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678387505] [2025-02-05 16:34:52,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:52,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:52,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:52,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:52,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:52,031 INFO L87 Difference]: Start difference. First operand 174011 states and 227669 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:53,042 INFO L93 Difference]: Finished difference Result 278093 states and 365522 transitions. [2025-02-05 16:34:53,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:53,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:34:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:53,388 INFO L225 Difference]: With dead ends: 278093 [2025-02-05 16:34:53,388 INFO L226 Difference]: Without dead ends: 242307 [2025-02-05 16:34:53,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:53,467 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 1578 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:53,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 1302 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242307 states. [2025-02-05 16:34:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242307 to 201091. [2025-02-05 16:34:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201091 states, 201090 states have (on average 1.3063852006564225) internal successors, (262701), 201090 states have internal predecessors, (262701), 0 states have call successors, (0), 0 states have call 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:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201091 states to 201091 states and 262701 transitions. [2025-02-05 16:34:56,706 INFO L78 Accepts]: Start accepts. Automaton has 201091 states and 262701 transitions. Word has length 93 [2025-02-05 16:34:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:56,706 INFO L471 AbstractCegarLoop]: Abstraction has 201091 states and 262701 transitions. [2025-02-05 16:34:56,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 201091 states and 262701 transitions. [2025-02-05 16:34:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:34:56,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:56,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:56,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:34:56,715 INFO L396 AbstractCegarLoop]: === Iteration 34 === 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:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1633379792, now seen corresponding path program 1 times [2025-02-05 16:34:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:56,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290329282] [2025-02-05 16:34:56,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:56,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:34:56,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:34:56,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:56,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:56,807 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:56,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:56,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290329282] [2025-02-05 16:34:56,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290329282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:56,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:56,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:56,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561845289] [2025-02-05 16:34:56,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:56,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:56,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:56,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:56,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:56,810 INFO L87 Difference]: Start difference. First operand 201091 states and 262701 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:57,724 INFO L93 Difference]: Finished difference Result 398862 states and 521130 transitions. [2025-02-05 16:34:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:58,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:34:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:58,697 INFO L225 Difference]: With dead ends: 398862 [2025-02-05 16:34:58,697 INFO L226 Difference]: Without dead ends: 278429 [2025-02-05 16:34:58,770 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:34:58,770 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 375 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:58,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 566 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278429 states. [2025-02-05 16:35:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278429 to 197616. [2025-02-05 16:35:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197616 states, 197615 states have (on average 1.3035650127773701) internal successors, (257604), 197615 states have internal predecessors, (257604), 0 states have call successors, (0), 0 states have call 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,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197616 states to 197616 states and 257604 transitions. [2025-02-05 16:35:01,581 INFO L78 Accepts]: Start accepts. Automaton has 197616 states and 257604 transitions. Word has length 94 [2025-02-05 16:35:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:01,581 INFO L471 AbstractCegarLoop]: Abstraction has 197616 states and 257604 transitions. [2025-02-05 16:35:01,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 197616 states and 257604 transitions. [2025-02-05 16:35:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:35:01,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:01,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:01,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:35:01,588 INFO L396 AbstractCegarLoop]: === Iteration 35 === 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,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -624000496, now seen corresponding path program 1 times [2025-02-05 16:35:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414030070] [2025-02-05 16:35:01,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:01,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:35:01,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:35:01,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:01,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:01,731 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,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:01,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414030070] [2025-02-05 16:35:01,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414030070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:01,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:01,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:01,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798278060] [2025-02-05 16:35:01,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:01,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:01,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:01,732 INFO L87 Difference]: Start difference. First operand 197616 states and 257604 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:02,900 INFO L93 Difference]: Finished difference Result 284194 states and 371969 transitions. [2025-02-05 16:35:02,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:02,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:35:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:03,239 INFO L225 Difference]: With dead ends: 284194 [2025-02-05 16:35:03,239 INFO L226 Difference]: Without dead ends: 249560 [2025-02-05 16:35:03,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:03,332 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1565 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:03,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 1295 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249560 states.