./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d0b255ca8288d7fec2d600e13b499a216c3c13b3ba13eac2e9a1248f762a9435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:07:39,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:07:39,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:07:39,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:07:39,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:07:39,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:07:39,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:07:39,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:07:39,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:07:39,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:07:39,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:07:39,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:07:39,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:07:39,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:07:39,091 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:07:39,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:07:39,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:07:39,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:07:39,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:07:39,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:07:39,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:07:39,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:07:39,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:07:39,093 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:07:39,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:39,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:07:39,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:07:39,094 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/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 -> d0b255ca8288d7fec2d600e13b499a216c3c13b3ba13eac2e9a1248f762a9435 [2025-03-03 15:07:39,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:07:39,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:07:39,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:07:39,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:07:39,325 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:07:39,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-03 15:07:40,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbc6f761/06237920a9c44a278d31e710ad295161/FLAG87feec8f2 [2025-03-03 15:07:40,813 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:07:40,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-03 15:07:40,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbc6f761/06237920a9c44a278d31e710ad295161/FLAG87feec8f2 [2025-03-03 15:07:40,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbc6f761/06237920a9c44a278d31e710ad295161 [2025-03-03 15:07:40,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:07:40,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:07:40,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:40,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:07:40,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:07:40,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:40" (1/1) ... [2025-03-03 15:07:40,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df60799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:40, skipping insertion in model container [2025-03-03 15:07:40,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:40" (1/1) ... [2025-03-03 15:07:41,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:07:41,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32048,32061] [2025-03-03 15:07:41,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[55802,55815] [2025-03-03 15:07:41,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[64372,64385] [2025-03-03 15:07:41,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[91775,91788] [2025-03-03 15:07:41,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[106857,106870] [2025-03-03 15:07:41,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[123963,123976] [2025-03-03 15:07:41,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[141761,141774] [2025-03-03 15:07:41,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:41,808 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:07:41,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32048,32061] [2025-03-03 15:07:41,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[55802,55815] [2025-03-03 15:07:41,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[64372,64385] [2025-03-03 15:07:41,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[91775,91788] [2025-03-03 15:07:41,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[106857,106870] [2025-03-03 15:07:41,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[123963,123976] [2025-03-03 15:07:41,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[141761,141774] [2025-03-03 15:07:42,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:42,122 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:07:42,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42 WrapperNode [2025-03-03 15:07:42,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:42,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:42,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:07:42,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:07:42,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,332 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10246 [2025-03-03 15:07:42,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:42,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:07:42,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:07:42,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:07:42,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,413 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-03-03 15:07:42,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:07:42,538 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:07:42,539 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:07:42,539 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:07:42,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (1/1) ... [2025-03-03 15:07:42,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:42,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:07:42,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:07:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:07:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:07:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:07:42,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:07:42,944 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:07:42,946 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:07:46,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027: havoc main_~check__tmp~2#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1; [2025-03-03 15:07:46,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13451: havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:46,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6848: havoc main_~node1__m1~18#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1;havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-03 15:07:46,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15833: havoc main_~node2____CPAchecker_TMP_1~6#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~64#1;havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~91#1;havoc main_~node4__m4~85#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~63#1;havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2623: havoc main_~node2__m2~7#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7909: havoc main_~node3__m3~50#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6588: havoc main_~node2__m2~21#1;havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12403: havoc main_~node3__m3~71#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~45#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~72#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3420: havoc main_~node3__m3~22#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16634: havoc main_~node4__m4~89#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~69#1;havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~96#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1836: havoc main_~node2__m2~5#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7124: havoc main_~node2__m2~23#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12145: havoc main_~node4__m4~67#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7919: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L788: havoc main_~node2__m2~2#1; [2025-03-03 15:07:46,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8716: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~28#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8981: havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2903: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6871: havoc main_~node2__m2~22#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7928: havoc main_~node4__m4~44#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4494: havoc main_~node2__m2~15#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~21#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16122: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~66#1;havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~93#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~65#1;havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~92#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16915: havoc main_~node2____CPAchecker_TMP_1~8#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~71#1;havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~98#1;havoc main_~node4__m4~91#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~70#1;havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~97#1;havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2645: havoc main_~node3__m3~13#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14802: havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4760: havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12953: havoc main_~node4__m4~70#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~48#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~75#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8461: havoc main_~node4__m4~47#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~24#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5028: havoc main_~node2__m2~17#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13486: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15337: havoc main_~node1__m1~61#1;havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~88#1;havoc main_~node4__m4~82#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~60#1;havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~87#1;havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10847: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~63#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~36#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13227: havoc main_~node2__m2~49#1;havoc main_~node1__m1~50#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~77#1;havoc main_~node4__m4~72#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~49#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~76#1;havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3187: havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~14#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2131: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6627: havoc main_~node4__m4~35#1;havoc main_~node3__m3~42#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3721: havoc main_~node3__m3~25#1; [2025-03-03 15:07:46,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14293: havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-03 15:07:46,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11915: havoc main_~node3__m3~68#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~42#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~69#1;havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-03 15:07:46,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9275: havoc main_~node4__m4~52#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:46,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4783: havoc main_~node2__m2~16#1; [2025-03-03 15:07:46,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17205: havoc main_~node2____CPAchecker_TMP_1~9#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~73#1;havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~100#1;havoc main_~node4__m4~92#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~72#1;havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~99#1; [2025-03-03 15:07:46,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10072: havoc main_~node1____CPAchecker_TMP_0~9#1;havoc main_~node1__m1~32#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~34#1; [2025-03-03 15:07:46,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9808: havoc main_~node4__m4~55#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~30#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-03-03 15:07:46,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:46,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11398: havoc main_~node1____CPAchecker_TMP_0~12#1;havoc main_~node1__m1~39#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~66#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~38#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1;havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1621: havoc main_~check__tmp~5#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1357: havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13514: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5851: havoc main_~node4__m4~30#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16422: havoc main_~node1__m1~68#1;havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~95#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~87#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~67#1;havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: havoc main_~node2__m2~10#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3740: havoc main_~node4__m4~16#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5590: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~28#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~36#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4533: havoc main_~node4__m4~21#1;havoc main_~node3__m3~30#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13784: havoc main_~node2__m2~51#1;havoc main_~node1__m1~52#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~79#1;havoc main_~node4__m4~74#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~51#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~78#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2422: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12728: havoc main_~node1____CPAchecker_TMP_0~13#1;havoc main_~node1__m1~47#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~74#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~46#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~73#1;havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-03 15:07:46,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15636: havoc main_~node4__m4~84#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7444: havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334: havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~26#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~35#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11677: havoc main_~node1__m1~41#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~68#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~40#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~67#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13794: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490: havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10361: havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905: havoc main_~check__tmp~7#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~9#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: havoc main_~node3__m3~14#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13271: havoc main_~node3__m3~76#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15122: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc main_~node3__m3~19#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7991: havoc main_~node1__m1~23#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1;havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:07:46,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6143: havoc main_~check__tmp~32#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~39#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16715: havoc main_~node4__m4~90#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12487: havoc main_~node3__m3~72#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8260: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~26#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4032: havoc main_~check__tmp~18#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~27#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975: havoc main_~node2__m2~9#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~13#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L863: havoc main_~check__tmp~1#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7207: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~46#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10643: havoc main_~node2__m2~37#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L339: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6417: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~41#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6946: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~44#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12497: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11176: havoc main_~node4__m4~63#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13823: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15938: havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10653: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15148: havoc main_~node3__m3~82#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12506: havoc main_~node4__m4~68#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9338: havoc main_~node1__m1~29#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1;havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2203: havoc main_~node2__m2~6#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~9#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2997: havoc main_~node3__m3~17#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12247: havoc main_~node3__m3~70#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~44#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~71#1;havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-03 15:07:46,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13040: havoc main_~node4__m4~71#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8548: havoc main_~node4__m4~48#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10663: havoc main_~node3__m3~63#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11985: havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9607: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~32#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4323: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~20#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~29#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15158: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6704: havoc main_~node4__m4~36#1;havoc main_~node3__m3~43#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13312: havoc main_~node4__m4~73#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5914: havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4858: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~23#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~32#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10673: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803: havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15167: havoc main_~node4__m4~81#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17021: havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7774: havoc main_~node1____CPAchecker_TMP_0~6#1;havoc main_~node1__m1~22#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~49#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10682: havoc main_~node4__m4~60#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9889: havoc main_~node4__m4~56#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: havoc main_~node3__m3~20#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2758: havoc main_~node2__m2~8#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7516: havoc main_~node2__m2~24#1;havoc main_~node1__m1~20#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4610: havoc main_~node4__m4~22#1;havoc main_~node3__m3~31#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15449: havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-03 15:07:46,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5937: havoc main_~node2__m2~19#1; [2025-03-03 15:07:46,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10959: havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-03 15:07:46,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_~node3__m3~0#1; [2025-03-03 15:07:46,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14396: havoc main_~node4__m4~77#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~55#1;havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~82#1; [2025-03-03 15:07:46,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3826: havoc main_~node2__m2~13#1; [2025-03-03 15:07:46,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3562: havoc main_~node2__m2~12#1;havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~15#1; [2025-03-03 15:07:46,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14661: havoc main_~node2__m2~55#1;havoc main_~node1__m1~57#1;havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~84#1;havoc main_~node4__m4~79#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~56#1;havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~83#1;havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16252: havoc main_~node4__m4~87#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14671: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~node3__m3~15#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13616: havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~node3__m3~18#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6221: havoc main_~node2__m2~20#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L672: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node4__m4~0#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1466: havoc main_~node4__m4~7#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4110: havoc main_~node2__m2~14#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13360: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-03 15:07:46,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3584: havoc main_~node3__m3~23#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5435: havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16534: havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1209: havoc main_~node2__m2~3#1;havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~3#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5174: havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~34#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8611: havoc main_~node1__m1~25#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1;havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11520: havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8879: havoc main_~node1____CPAchecker_TMP_0~7#1;havoc main_~node1__m1~26#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~29#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2537: havoc main_~node4__m4~14#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8351: havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-03 15:07:46,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12317: havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14171: havoc main_~node1____CPAchecker_TMP_0~14#1;havoc main_~node1__m1~54#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~81#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~53#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~80#1;havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8093: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~51#1;havoc main_~node2__m2~25#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9150: havoc main_~node1____CPAchecker_TMP_0~8#1;havoc main_~node1__m1~28#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1;havoc main_~node4__m4~51#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~27#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12850: havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14700: havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2283: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~10#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1758: havoc main_~check__tmp~6#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6516: havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3345: havoc main_~node2__m2~11#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14973: havoc main_~node2__m2~57#1;havoc main_~node1__m1~59#1;havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~86#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~58#1;havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~85#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9952: havoc main_~node1__m1~31#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1;havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13388: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5725: havoc main_~node1____CPAchecker_TMP_0~3#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~37#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6785: havoc main_~node4__m4~37#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12071: havoc main_~node3__m3~69#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~43#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~70#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2032: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~8#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9698: havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14983: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11813: havoc main_~node4__m4~66#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7058: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~45#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2833: havoc main_~node3__m3~16#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9440: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~31#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc main_~check__tmp~31#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~38#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4422: havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3895: havoc main_~check__tmp~17#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~26#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3367: havoc main_~node3__m3~21#1; [2025-03-03 15:07:46,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3637: havoc main_~node3__m3~24#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4961: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~33#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4697: havoc main_~node4__m4~23#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7342: havoc main_~node1____CPAchecker_TMP_0~4#1;havoc main_~node1__m1~19#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~47#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14477: havoc main_~node4__m4~78#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13949: havoc main_~node4__m4~75#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13423: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6290: havoc main_~check__tmp~33#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~40#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15012: havoc main_~node2____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7614: havoc main_~node1____CPAchecker_TMP_0~5#1;havoc main_~node1__m1~21#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~48#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3124: havoc main_~node4__m4~15#1; [2025-03-03 15:07:46,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10260: havoc main_~node1____CPAchecker_TMP_0~10#1;havoc main_~node1__m1~33#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~59#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~35#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7883: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2600: havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5507: havoc main_~node2__m2~18#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~27#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15549: havoc main_~node4__m4~83#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~62#1;havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~89#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10530: havoc main_~node1____CPAchecker_TMP_0~11#1;havoc main_~node1__m1~35#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~61#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~34#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~60#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4193: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~28#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L494: havoc main_~node2__m2~1#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1552: havoc main_~node2__m2~4#1; [2025-03-03 15:07:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11067: havoc main_~node4__m4~62#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~37#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-03-03 15:07:47,075 INFO L? ?]: Removed 1980 outVars from TransFormulas that were not future-live. [2025-03-03 15:07:47,076 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:07:47,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:07:47,162 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:07:47,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:47 BoogieIcfgContainer [2025-03-03 15:07:47,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:07:47,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:07:47,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:07:47,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:07:47,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:07:40" (1/3) ... [2025-03-03 15:07:47,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452664d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:47, skipping insertion in model container [2025-03-03 15:07:47,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:42" (2/3) ... [2025-03-03 15:07:47,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452664d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:47, skipping insertion in model container [2025-03-03 15:07:47,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:47" (3/3) ... [2025-03-03 15:07:47,171 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-03 15:07:47,183 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:07:47,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c that has 1 procedures, 2046 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-03 15:07:47,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:07:47,288 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;@5e2ab4e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:07:47,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-03 15:07:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 2046 states, 2038 states have (on average 1.776251226692836) internal successors, (3620), 2045 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:07:47,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:47,325 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-03-03 15:07:47,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:47,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash -835191730, now seen corresponding path program 1 times [2025-03-03 15:07:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299574623] [2025-03-03 15:07:47,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:47,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:07:47,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:07:47,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:47,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:47,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:47,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299574623] [2025-03-03 15:07:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299574623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:47,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:47,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:47,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56768663] [2025-03-03 15:07:47,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:47,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:47,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:47,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:47,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:47,953 INFO L87 Difference]: Start difference. First operand has 2046 states, 2038 states have (on average 1.776251226692836) internal successors, (3620), 2045 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:49,387 INFO L93 Difference]: Finished difference Result 3316 states and 5749 transitions. [2025-03-03 15:07:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:49,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:07:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:49,408 INFO L225 Difference]: With dead ends: 3316 [2025-03-03 15:07:49,408 INFO L226 Difference]: Without dead ends: 2141 [2025-03-03 15:07:49,413 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-03-03 15:07:49,415 INFO L435 NwaCegarLoop]: 1725 mSDtfsCounter, 10212 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10212 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:49,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10212 Valid, 2252 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:07:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2025-03-03 15:07:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2126. [2025-03-03 15:07:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 2119 states have (on average 1.3034450212364324) internal successors, (2762), 2125 states have internal predecessors, (2762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2762 transitions. [2025-03-03 15:07:49,506 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2762 transitions. Word has length 65 [2025-03-03 15:07:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:49,507 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 2762 transitions. [2025-03-03 15:07:49,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2762 transitions. [2025-03-03 15:07:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:07:49,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:49,515 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-03-03 15:07:49,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:07:49,516 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-03-03 15:07:49,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash 563462342, now seen corresponding path program 1 times [2025-03-03 15:07:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:49,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930226963] [2025-03-03 15:07:49,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:49,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:07:49,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:07:49,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:49,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:49,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930226963] [2025-03-03 15:07:49,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930226963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:49,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:49,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533631503] [2025-03-03 15:07:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:49,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:49,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:49,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:49,687 INFO L87 Difference]: Start difference. First operand 2126 states and 2762 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-03-03 15:07:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:50,683 INFO L93 Difference]: Finished difference Result 3787 states and 4930 transitions. [2025-03-03 15:07:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:50,684 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-03-03 15:07:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:50,692 INFO L225 Difference]: With dead ends: 3787 [2025-03-03 15:07:50,693 INFO L226 Difference]: Without dead ends: 2511 [2025-03-03 15:07:50,695 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-03-03 15:07:50,696 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 6514 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6514 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:50,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6514 Valid, 1255 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:07:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2025-03-03 15:07:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2501. [2025-03-03 15:07:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2494 states have (on average 1.305934242181235) internal successors, (3257), 2500 states have internal predecessors, (3257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3257 transitions. [2025-03-03 15:07:50,755 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3257 transitions. Word has length 66 [2025-03-03 15:07:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:50,755 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3257 transitions. [2025-03-03 15:07:50,756 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-03-03 15:07:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3257 transitions. [2025-03-03 15:07:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:07:50,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:50,761 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-03-03 15:07:50,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:07:50,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1391318714, now seen corresponding path program 1 times [2025-03-03 15:07:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233116842] [2025-03-03 15:07:50,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:50,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:07:50,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:07:50,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:50,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:50,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233116842] [2025-03-03 15:07:50,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233116842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:50,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974329017] [2025-03-03 15:07:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:50,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:50,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:50,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:50,951 INFO L87 Difference]: Start difference. First operand 2501 states and 3257 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-03-03 15:07:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:51,891 INFO L93 Difference]: Finished difference Result 5233 states and 6852 transitions. [2025-03-03 15:07:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:51,892 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-03-03 15:07:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:51,901 INFO L225 Difference]: With dead ends: 5233 [2025-03-03 15:07:51,901 INFO L226 Difference]: Without dead ends: 3594 [2025-03-03 15:07:51,902 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-03-03 15:07:51,903 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 6268 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6268 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:51,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6268 Valid, 1266 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:07:51,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-03-03 15:07:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3578. [2025-03-03 15:07:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3578 states, 3571 states have (on average 1.2906748809857183) internal successors, (4609), 3577 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 4609 transitions. [2025-03-03 15:07:51,962 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 4609 transitions. Word has length 66 [2025-03-03 15:07:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:51,962 INFO L471 AbstractCegarLoop]: Abstraction has 3578 states and 4609 transitions. [2025-03-03 15:07:51,962 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-03-03 15:07:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 4609 transitions. [2025-03-03 15:07:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:07:51,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:51,966 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-03-03 15:07:51,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:07:51,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:51,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1854117820, now seen corresponding path program 1 times [2025-03-03 15:07:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557935649] [2025-03-03 15:07:51,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:51,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:07:52,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:07:52,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:52,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557935649] [2025-03-03 15:07:52,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557935649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:52,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:52,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:52,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752433116] [2025-03-03 15:07:52,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:52,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:52,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:52,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:52,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:52,073 INFO L87 Difference]: Start difference. First operand 3578 states and 4609 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:52,966 INFO L93 Difference]: Finished difference Result 8117 states and 10646 transitions. [2025-03-03 15:07:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:07:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:52,978 INFO L225 Difference]: With dead ends: 8117 [2025-03-03 15:07:52,979 INFO L226 Difference]: Without dead ends: 5317 [2025-03-03 15:07:52,981 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-03-03 15:07:52,982 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 6583 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6583 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:52,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6583 Valid, 1319 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:07:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2025-03-03 15:07:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5311. [2025-03-03 15:07:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5311 states, 5304 states have (on average 1.3001508295625943) internal successors, (6896), 5310 states have internal predecessors, (6896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 6896 transitions. [2025-03-03 15:07:53,056 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 6896 transitions. Word has length 67 [2025-03-03 15:07:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:53,056 INFO L471 AbstractCegarLoop]: Abstraction has 5311 states and 6896 transitions. [2025-03-03 15:07:53,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 6896 transitions. [2025-03-03 15:07:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:07:53,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:53,060 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-03-03 15:07:53,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:07:53,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:53,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 92124390, now seen corresponding path program 1 times [2025-03-03 15:07:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157514567] [2025-03-03 15:07:53,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:53,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:07:53,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:07:53,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:53,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:53,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-03-03 15:07:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:53,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157514567] [2025-03-03 15:07:53,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157514567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:53,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:53,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:07:53,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497951576] [2025-03-03 15:07:53,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:53,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:07:53,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:53,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:07:53,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:07:53,385 INFO L87 Difference]: Start difference. First operand 5311 states and 6896 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 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-03-03 15:07:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:55,131 INFO L93 Difference]: Finished difference Result 8266 states and 10985 transitions. [2025-03-03 15:07:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:55,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 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-03-03 15:07:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:55,148 INFO L225 Difference]: With dead ends: 8266 [2025-03-03 15:07:55,148 INFO L226 Difference]: Without dead ends: 6821 [2025-03-03 15:07:55,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:07:55,153 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 6308 mSDsluCounter, 3956 mSDsCounter, 0 mSdLazyCounter, 4709 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6308 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 4720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:55,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6308 Valid, 4864 Invalid, 4720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4709 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:07:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2025-03-03 15:07:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 5318. [2025-03-03 15:07:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 5311 states have (on average 1.2997552250047073) internal successors, (6903), 5317 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 6903 transitions. [2025-03-03 15:07:55,295 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 6903 transitions. Word has length 67 [2025-03-03 15:07:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:55,296 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 6903 transitions. [2025-03-03 15:07:55,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 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-03-03 15:07:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 6903 transitions. [2025-03-03 15:07:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:55,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:55,301 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-03-03 15:07:55,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:07:55,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:55,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2083384234, now seen corresponding path program 1 times [2025-03-03 15:07:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:55,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851928290] [2025-03-03 15:07:55,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:55,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:55,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:55,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:55,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851928290] [2025-03-03 15:07:55,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851928290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:55,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:55,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796031613] [2025-03-03 15:07:55,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:55,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:55,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:55,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:55,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:55,644 INFO L87 Difference]: Start difference. First operand 5318 states and 6903 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-03-03 15:07:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:57,039 INFO L93 Difference]: Finished difference Result 7846 states and 10518 transitions. [2025-03-03 15:07:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:07:57,039 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-03-03 15:07:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:57,056 INFO L225 Difference]: With dead ends: 7846 [2025-03-03 15:07:57,056 INFO L226 Difference]: Without dead ends: 7840 [2025-03-03 15:07:57,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:07:57,059 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 7918 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 3549 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7918 SdHoareTripleChecker+Valid, 4148 SdHoareTripleChecker+Invalid, 3570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:57,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7918 Valid, 4148 Invalid, 3570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3549 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:07:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7840 states. [2025-03-03 15:07:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7840 to 5318. [2025-03-03 15:07:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 5311 states have (on average 1.2995669365467897) internal successors, (6902), 5317 states have internal predecessors, (6902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 6902 transitions. [2025-03-03 15:07:57,152 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 6902 transitions. Word has length 68 [2025-03-03 15:07:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:57,152 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 6902 transitions. [2025-03-03 15:07:57,152 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-03-03 15:07:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 6902 transitions. [2025-03-03 15:07:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:57,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:57,157 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-03-03 15:07:57,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:07:57,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1942467211, now seen corresponding path program 1 times [2025-03-03 15:07:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126986563] [2025-03-03 15:07:57,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:57,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:57,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:57,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:57,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:57,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:57,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126986563] [2025-03-03 15:07:57,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126986563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:57,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:57,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830091223] [2025-03-03 15:07:57,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:57,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:57,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:57,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:57,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:57,220 INFO L87 Difference]: Start difference. First operand 5318 states and 6902 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-03-03 15:07:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:57,401 INFO L93 Difference]: Finished difference Result 10622 states and 13946 transitions. [2025-03-03 15:07:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:57,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-03-03 15:07:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:57,414 INFO L225 Difference]: With dead ends: 10622 [2025-03-03 15:07:57,414 INFO L226 Difference]: Without dead ends: 6513 [2025-03-03 15:07:57,418 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-03-03 15:07:57,419 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1612 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:57,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 2168 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2025-03-03 15:07:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 6502. [2025-03-03 15:07:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6502 states, 6495 states have (on average 1.2989992301770592) internal successors, (8437), 6501 states have internal predecessors, (8437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6502 states to 6502 states and 8437 transitions. [2025-03-03 15:07:57,487 INFO L78 Accepts]: Start accepts. Automaton has 6502 states and 8437 transitions. Word has length 68 [2025-03-03 15:07:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:57,487 INFO L471 AbstractCegarLoop]: Abstraction has 6502 states and 8437 transitions. [2025-03-03 15:07:57,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-03-03 15:07:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6502 states and 8437 transitions. [2025-03-03 15:07:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:57,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:57,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:57,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:07:57,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:57,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1849678378, now seen corresponding path program 1 times [2025-03-03 15:07:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:57,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420377155] [2025-03-03 15:07:57,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:57,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:57,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:57,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:57,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420377155] [2025-03-03 15:07:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420377155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:58,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:58,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:07:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563100321] [2025-03-03 15:07:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:58,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:07:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:58,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:07:58,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:07:58,077 INFO L87 Difference]: Start difference. First operand 6502 states and 8437 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-03 15:07:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:58,967 INFO L93 Difference]: Finished difference Result 8950 states and 11933 transitions. [2025-03-03 15:07:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:07:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-03 15:07:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:58,981 INFO L225 Difference]: With dead ends: 8950 [2025-03-03 15:07:58,981 INFO L226 Difference]: Without dead ends: 8946 [2025-03-03 15:07:58,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:07:58,985 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 6189 mSDsluCounter, 6384 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6189 SdHoareTripleChecker+Valid, 7907 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:58,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6189 Valid, 7907 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:07:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8946 states. [2025-03-03 15:07:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8946 to 6498. [2025-03-03 15:07:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6498 states, 6492 states have (on average 1.2989833641404807) internal successors, (8433), 6497 states have internal predecessors, (8433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6498 states to 6498 states and 8433 transitions. [2025-03-03 15:07:59,057 INFO L78 Accepts]: Start accepts. Automaton has 6498 states and 8433 transitions. Word has length 68 [2025-03-03 15:07:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:59,058 INFO L471 AbstractCegarLoop]: Abstraction has 6498 states and 8433 transitions. [2025-03-03 15:07:59,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-03 15:07:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6498 states and 8433 transitions. [2025-03-03 15:07:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:07:59,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:59,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:59,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:07:59,062 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:07:59,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1398532456, now seen corresponding path program 1 times [2025-03-03 15:07:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:59,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168879891] [2025-03-03 15:07:59,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:59,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:07:59,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:07:59,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:59,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168879891] [2025-03-03 15:07:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168879891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:59,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:59,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:07:59,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593891894] [2025-03-03 15:07:59,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:59,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:07:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:59,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:07:59,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:07:59,361 INFO L87 Difference]: Start difference. First operand 6498 states and 8433 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 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-03-03 15:08:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:01,167 INFO L93 Difference]: Finished difference Result 10521 states and 14095 transitions. [2025-03-03 15:08:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 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-03-03 15:08:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:01,180 INFO L225 Difference]: With dead ends: 10521 [2025-03-03 15:08:01,180 INFO L226 Difference]: Without dead ends: 8575 [2025-03-03 15:08:01,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:01,184 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 8676 mSDsluCounter, 3885 mSDsCounter, 0 mSdLazyCounter, 4323 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8676 SdHoareTripleChecker+Valid, 4802 SdHoareTripleChecker+Invalid, 4354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:01,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8676 Valid, 4802 Invalid, 4354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4323 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:08:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8575 states. [2025-03-03 15:08:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8575 to 6470. [2025-03-03 15:08:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6470 states, 6464 states have (on average 1.2995049504950495) internal successors, (8400), 6469 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6470 states to 6470 states and 8400 transitions. [2025-03-03 15:08:01,270 INFO L78 Accepts]: Start accepts. Automaton has 6470 states and 8400 transitions. Word has length 69 [2025-03-03 15:08:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:01,270 INFO L471 AbstractCegarLoop]: Abstraction has 6470 states and 8400 transitions. [2025-03-03 15:08:01,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 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-03-03 15:08:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6470 states and 8400 transitions. [2025-03-03 15:08:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:01,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:01,274 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-03-03 15:08:01,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:08:01,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:01,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 337437297, now seen corresponding path program 1 times [2025-03-03 15:08:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159255342] [2025-03-03 15:08:01,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:01,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:01,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:01,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:01,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:01,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:01,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159255342] [2025-03-03 15:08:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159255342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:01,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033410943] [2025-03-03 15:08:01,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:01,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:01,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:01,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:01,770 INFO L87 Difference]: Start difference. First operand 6470 states and 8400 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-03-03 15:08:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:02,791 INFO L93 Difference]: Finished difference Result 10955 states and 14774 transitions. [2025-03-03 15:08:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:02,792 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-03-03 15:08:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:02,808 INFO L225 Difference]: With dead ends: 10955 [2025-03-03 15:08:02,808 INFO L226 Difference]: Without dead ends: 10946 [2025-03-03 15:08:02,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:02,812 INFO L435 NwaCegarLoop]: 1686 mSDtfsCounter, 10150 mSDsluCounter, 7039 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10150 SdHoareTripleChecker+Valid, 8725 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:02,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10150 Valid, 8725 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:08:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10946 states. [2025-03-03 15:08:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10946 to 6461. [2025-03-03 15:08:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6461 states, 6456 states have (on average 1.299721189591078) internal successors, (8391), 6460 states have internal predecessors, (8391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6461 states to 6461 states and 8391 transitions. [2025-03-03 15:08:02,900 INFO L78 Accepts]: Start accepts. Automaton has 6461 states and 8391 transitions. Word has length 69 [2025-03-03 15:08:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:02,901 INFO L471 AbstractCegarLoop]: Abstraction has 6461 states and 8391 transitions. [2025-03-03 15:08:02,901 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-03-03 15:08:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6461 states and 8391 transitions. [2025-03-03 15:08:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:02,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:02,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:02,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:08:02,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2086657442, now seen corresponding path program 1 times [2025-03-03 15:08:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391781858] [2025-03-03 15:08:02,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:02,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:02,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:02,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:02,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:03,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:03,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391781858] [2025-03-03 15:08:03,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391781858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:03,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:03,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:08:03,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785795988] [2025-03-03 15:08:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:03,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:08:03,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:03,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:08:03,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:08:03,416 INFO L87 Difference]: Start difference. First operand 6461 states and 8391 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:04,343 INFO L93 Difference]: Finished difference Result 8909 states and 11887 transitions. [2025-03-03 15:08:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:04,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:04,354 INFO L225 Difference]: With dead ends: 8909 [2025-03-03 15:08:04,354 INFO L226 Difference]: Without dead ends: 8905 [2025-03-03 15:08:04,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:08:04,358 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 9851 mSDsluCounter, 7524 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9851 SdHoareTripleChecker+Valid, 9036 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:04,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9851 Valid, 9036 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:08:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8905 states. [2025-03-03 15:08:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8905 to 6457. [2025-03-03 15:08:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6457 states, 6453 states have (on average 1.2997055633038896) internal successors, (8387), 6456 states have internal predecessors, (8387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6457 states to 6457 states and 8387 transitions. [2025-03-03 15:08:04,434 INFO L78 Accepts]: Start accepts. Automaton has 6457 states and 8387 transitions. Word has length 70 [2025-03-03 15:08:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:04,434 INFO L471 AbstractCegarLoop]: Abstraction has 6457 states and 8387 transitions. [2025-03-03 15:08:04,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 6457 states and 8387 transitions. [2025-03-03 15:08:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:04,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:04,438 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-03-03 15:08:04,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:08:04,440 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1030652562, now seen corresponding path program 1 times [2025-03-03 15:08:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901084046] [2025-03-03 15:08:04,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:04,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:04,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:04,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:04,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:04,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901084046] [2025-03-03 15:08:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901084046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:04,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317693753] [2025-03-03 15:08:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:04,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:04,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:04,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:04,498 INFO L87 Difference]: Start difference. First operand 6457 states and 8387 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-03-03 15:08:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:04,590 INFO L93 Difference]: Finished difference Result 10313 states and 13865 transitions. [2025-03-03 15:08:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:04,590 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-03-03 15:08:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:04,598 INFO L225 Difference]: With dead ends: 10313 [2025-03-03 15:08:04,598 INFO L226 Difference]: Without dead ends: 6294 [2025-03-03 15:08:04,603 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-03-03 15:08:04,604 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 1236 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:04,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1732 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6294 states. [2025-03-03 15:08:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6294 to 6281. [2025-03-03 15:08:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6281 states, 6278 states have (on average 1.3381650207072315) internal successors, (8401), 6280 states have internal predecessors, (8401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8401 transitions. [2025-03-03 15:08:04,693 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8401 transitions. Word has length 71 [2025-03-03 15:08:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:04,694 INFO L471 AbstractCegarLoop]: Abstraction has 6281 states and 8401 transitions. [2025-03-03 15:08:04,694 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-03-03 15:08:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8401 transitions. [2025-03-03 15:08:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:04,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:04,697 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-03-03 15:08:04,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:08:04,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 868645556, now seen corresponding path program 1 times [2025-03-03 15:08:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263764908] [2025-03-03 15:08:04,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:04,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:04,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:04,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:04,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:04,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:04,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263764908] [2025-03-03 15:08:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263764908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:04,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:04,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29966624] [2025-03-03 15:08:04,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:04,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:04,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:04,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:04,880 INFO L87 Difference]: Start difference. First operand 6281 states and 8401 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 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-03-03 15:08:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:06,164 INFO L93 Difference]: Finished difference Result 11047 states and 15051 transitions. [2025-03-03 15:08:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 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-03-03 15:08:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:06,176 INFO L225 Difference]: With dead ends: 11047 [2025-03-03 15:08:06,176 INFO L226 Difference]: Without dead ends: 11038 [2025-03-03 15:08:06,179 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-03-03 15:08:06,180 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 3440 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3440 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:06,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3440 Valid, 3253 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:08:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11038 states. [2025-03-03 15:08:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11038 to 6281. [2025-03-03 15:08:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6281 states, 6278 states have (on average 1.3380057343102898) internal successors, (8400), 6280 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8400 transitions. [2025-03-03 15:08:06,262 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8400 transitions. Word has length 71 [2025-03-03 15:08:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:06,262 INFO L471 AbstractCegarLoop]: Abstraction has 6281 states and 8400 transitions. [2025-03-03 15:08:06,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 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-03-03 15:08:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8400 transitions. [2025-03-03 15:08:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:06,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:06,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:06,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:08:06,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:06,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash 397764755, now seen corresponding path program 1 times [2025-03-03 15:08:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166701674] [2025-03-03 15:08:06,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:06,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:06,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:06,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:06,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166701674] [2025-03-03 15:08:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166701674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:06,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:06,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928888514] [2025-03-03 15:08:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:06,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:06,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:06,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:06,496 INFO L87 Difference]: Start difference. First operand 6281 states and 8400 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:07,863 INFO L93 Difference]: Finished difference Result 9664 states and 13302 transitions. [2025-03-03 15:08:07,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:07,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:07,867 INFO L225 Difference]: With dead ends: 9664 [2025-03-03 15:08:07,868 INFO L226 Difference]: Without dead ends: 6369 [2025-03-03 15:08:07,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:07,871 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 4505 mSDsluCounter, 2992 mSDsCounter, 0 mSdLazyCounter, 3286 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4505 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:07,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4505 Valid, 3690 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3286 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:08:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2025-03-03 15:08:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 6281. [2025-03-03 15:08:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6281 states, 6278 states have (on average 1.3378464479133483) internal successors, (8399), 6280 states have internal predecessors, (8399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8399 transitions. [2025-03-03 15:08:07,924 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8399 transitions. Word has length 72 [2025-03-03 15:08:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:07,924 INFO L471 AbstractCegarLoop]: Abstraction has 6281 states and 8399 transitions. [2025-03-03 15:08:07,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8399 transitions. [2025-03-03 15:08:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:07,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:07,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:07,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:08:07,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash -146686844, now seen corresponding path program 1 times [2025-03-03 15:08:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:07,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790464972] [2025-03-03 15:08:07,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:07,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:07,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:07,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:07,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:09,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:09,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790464972] [2025-03-03 15:08:09,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790464972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:09,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 15:08:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000210177] [2025-03-03 15:08:09,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:09,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 15:08:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:09,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 15:08:09,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:08:09,004 INFO L87 Difference]: Start difference. First operand 6281 states and 8399 transitions. Second operand has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,479 INFO L93 Difference]: Finished difference Result 8890 states and 12072 transitions. [2025-03-03 15:08:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:08:11,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,487 INFO L225 Difference]: With dead ends: 8890 [2025-03-03 15:08:11,487 INFO L226 Difference]: Without dead ends: 8878 [2025-03-03 15:08:11,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 15:08:11,490 INFO L435 NwaCegarLoop]: 1200 mSDtfsCounter, 6934 mSDsluCounter, 13502 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6934 SdHoareTripleChecker+Valid, 14702 SdHoareTripleChecker+Invalid, 3716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6934 Valid, 14702 Invalid, 3716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 15:08:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8878 states. [2025-03-03 15:08:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8878 to 6269. [2025-03-03 15:08:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6269 states, 6267 states have (on average 1.3382798787298549) internal successors, (8387), 6268 states have internal predecessors, (8387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8387 transitions. [2025-03-03 15:08:11,553 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8387 transitions. Word has length 72 [2025-03-03 15:08:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,553 INFO L471 AbstractCegarLoop]: Abstraction has 6269 states and 8387 transitions. [2025-03-03 15:08:11,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8387 transitions. [2025-03-03 15:08:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:08:11,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:11,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:08:11,558 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,559 INFO L85 PathProgramCache]: Analyzing trace with hash -444664418, now seen corresponding path program 1 times [2025-03-03 15:08:11,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192935918] [2025-03-03 15:08:11,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:08:11,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:08:11,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:11,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192935918] [2025-03-03 15:08:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192935918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269052595] [2025-03-03 15:08:11,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:11,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:11,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:11,616 INFO L87 Difference]: Start difference. First operand 6269 states and 8387 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,705 INFO L93 Difference]: Finished difference Result 11828 states and 16679 transitions. [2025-03-03 15:08:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:11,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:08:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,713 INFO L225 Difference]: With dead ends: 11828 [2025-03-03 15:08:11,713 INFO L226 Difference]: Without dead ends: 8109 [2025-03-03 15:08:11,716 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-03-03 15:08:11,718 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 803 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1884 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2025-03-03 15:08:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 8107. [2025-03-03 15:08:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8107 states, 8105 states have (on average 1.381122763726095) internal successors, (11194), 8106 states have internal predecessors, (11194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 11194 transitions. [2025-03-03 15:08:11,788 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 11194 transitions. Word has length 73 [2025-03-03 15:08:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,788 INFO L471 AbstractCegarLoop]: Abstraction has 8107 states and 11194 transitions. [2025-03-03 15:08:11,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 11194 transitions. [2025-03-03 15:08:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:08:11,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:11,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:08:11,791 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-03-03 15:08:11,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1622380857, now seen corresponding path program 1 times [2025-03-03 15:08:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126547616] [2025-03-03 15:08:11,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:08:11,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:08:11,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126547616] [2025-03-03 15:08:11,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126547616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052503067] [2025-03-03 15:08:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:11,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:11,971 INFO L87 Difference]: Start difference. First operand 8107 states and 11194 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:13,127 INFO L93 Difference]: Finished difference Result 11905 states and 16451 transitions. [2025-03-03 15:08:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:13,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:08:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:13,137 INFO L225 Difference]: With dead ends: 11905 [2025-03-03 15:08:13,137 INFO L226 Difference]: Without dead ends: 10394 [2025-03-03 15:08:13,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:08:13,140 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 4488 mSDsluCounter, 3212 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4488 SdHoareTripleChecker+Valid, 3973 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:13,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4488 Valid, 3973 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:08:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10394 states. [2025-03-03 15:08:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10394 to 8107. [2025-03-03 15:08:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8107 states, 8105 states have (on average 1.3809993830968539) internal successors, (11193), 8106 states have internal predecessors, (11193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 11193 transitions. [2025-03-03 15:08:13,275 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 11193 transitions. Word has length 73 [2025-03-03 15:08:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:13,276 INFO L471 AbstractCegarLoop]: Abstraction has 8107 states and 11193 transitions. [2025-03-03 15:08:13,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 11193 transitions. [2025-03-03 15:08:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:08:13,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:13,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:13,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:08:13,284 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:13,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1003118546, now seen corresponding path program 1 times [2025-03-03 15:08:13,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:13,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739454657] [2025-03-03 15:08:13,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:13,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:08:13,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:08:13,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:13,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739454657] [2025-03-03 15:08:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739454657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:13,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795858685] [2025-03-03 15:08:13,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:13,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:13,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:13,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:13,541 INFO L87 Difference]: Start difference. First operand 8107 states and 11193 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:14,669 INFO L93 Difference]: Finished difference Result 16552 states and 23169 transitions. [2025-03-03 15:08:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:08:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:14,683 INFO L225 Difference]: With dead ends: 16552 [2025-03-03 15:08:14,683 INFO L226 Difference]: Without dead ends: 15113 [2025-03-03 15:08:14,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:14,688 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 6494 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6494 SdHoareTripleChecker+Valid, 3288 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:14,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6494 Valid, 3288 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:08:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15113 states. [2025-03-03 15:08:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15113 to 8107. [2025-03-03 15:08:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8107 states, 8105 states have (on average 1.3808760024676126) internal successors, (11192), 8106 states have internal predecessors, (11192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 11192 transitions. [2025-03-03 15:08:14,773 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 11192 transitions. Word has length 73 [2025-03-03 15:08:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:14,774 INFO L471 AbstractCegarLoop]: Abstraction has 8107 states and 11192 transitions. [2025-03-03 15:08:14,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 11192 transitions. [2025-03-03 15:08:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:14,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:14,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:14,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:08:14,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:14,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash -675653358, now seen corresponding path program 1 times [2025-03-03 15:08:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119687162] [2025-03-03 15:08:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:14,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:14,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:14,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:14,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119687162] [2025-03-03 15:08:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119687162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411781622] [2025-03-03 15:08:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:14,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:14,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:14,847 INFO L87 Difference]: Start difference. First operand 8107 states and 11192 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:14,925 INFO L93 Difference]: Finished difference Result 19698 states and 27894 transitions. [2025-03-03 15:08:14,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:14,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:14,940 INFO L225 Difference]: With dead ends: 19698 [2025-03-03 15:08:14,940 INFO L226 Difference]: Without dead ends: 13713 [2025-03-03 15:08:14,949 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-03-03 15:08:14,949 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 795 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:14,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2404 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13713 states. [2025-03-03 15:08:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13713 to 13711. [2025-03-03 15:08:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13711 states, 13709 states have (on average 1.3866073382449486) internal successors, (19009), 13710 states have internal predecessors, (19009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13711 states to 13711 states and 19009 transitions. [2025-03-03 15:08:15,079 INFO L78 Accepts]: Start accepts. Automaton has 13711 states and 19009 transitions. Word has length 74 [2025-03-03 15:08:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:15,079 INFO L471 AbstractCegarLoop]: Abstraction has 13711 states and 19009 transitions. [2025-03-03 15:08:15,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 13711 states and 19009 transitions. [2025-03-03 15:08:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:15,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:15,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:15,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:08:15,085 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1883126141, now seen corresponding path program 1 times [2025-03-03 15:08:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489732557] [2025-03-03 15:08:15,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:15,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:15,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:15,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:15,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489732557] [2025-03-03 15:08:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489732557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:15,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:15,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776667336] [2025-03-03 15:08:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:15,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:15,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:15,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:15,202 INFO L87 Difference]: Start difference. First operand 13711 states and 19009 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:15,337 INFO L93 Difference]: Finished difference Result 29309 states and 41888 transitions. [2025-03-03 15:08:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:15,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:15,360 INFO L225 Difference]: With dead ends: 29309 [2025-03-03 15:08:15,360 INFO L226 Difference]: Without dead ends: 18704 [2025-03-03 15:08:15,373 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-03-03 15:08:15,374 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 762 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:15,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1857 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18704 states. [2025-03-03 15:08:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18704 to 14966. [2025-03-03 15:08:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14966 states, 14964 states have (on average 1.4016974071103983) internal successors, (20975), 14965 states have internal predecessors, (20975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14966 states to 14966 states and 20975 transitions. [2025-03-03 15:08:15,541 INFO L78 Accepts]: Start accepts. Automaton has 14966 states and 20975 transitions. Word has length 74 [2025-03-03 15:08:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:15,541 INFO L471 AbstractCegarLoop]: Abstraction has 14966 states and 20975 transitions. [2025-03-03 15:08:15,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 14966 states and 20975 transitions. [2025-03-03 15:08:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:15,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:15,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:15,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:08:15,545 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:15,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash -251871702, now seen corresponding path program 1 times [2025-03-03 15:08:15,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:15,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429246415] [2025-03-03 15:08:15,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:15,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:15,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:15,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:15,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:15,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:15,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429246415] [2025-03-03 15:08:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429246415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:15,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:15,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308409412] [2025-03-03 15:08:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:15,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:15,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:15,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:15,590 INFO L87 Difference]: Start difference. First operand 14966 states and 20975 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:15,712 INFO L93 Difference]: Finished difference Result 31110 states and 44170 transitions. [2025-03-03 15:08:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:15,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:08:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:15,727 INFO L225 Difference]: With dead ends: 31110 [2025-03-03 15:08:15,727 INFO L226 Difference]: Without dead ends: 17184 [2025-03-03 15:08:15,738 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-03-03 15:08:15,739 INFO L435 NwaCegarLoop]: 1203 mSDtfsCounter, 1130 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:15,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 1634 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17184 states. [2025-03-03 15:08:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17184 to 13778. [2025-03-03 15:08:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13776 states have (on average 1.4160859465737514) internal successors, (19508), 13777 states have internal predecessors, (19508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 19508 transitions. [2025-03-03 15:08:15,853 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 19508 transitions. Word has length 75 [2025-03-03 15:08:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:15,854 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 19508 transitions. [2025-03-03 15:08:15,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 19508 transitions. [2025-03-03 15:08:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:15,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:15,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:15,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:08:15,856 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:15,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash -782463136, now seen corresponding path program 1 times [2025-03-03 15:08:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:15,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247249267] [2025-03-03 15:08:15,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:15,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:15,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:15,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:15,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247249267] [2025-03-03 15:08:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247249267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:16,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:16,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550128642] [2025-03-03 15:08:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:16,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:16,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:16,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:16,076 INFO L87 Difference]: Start difference. First operand 13778 states and 19508 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:17,185 INFO L93 Difference]: Finished difference Result 17845 states and 25114 transitions. [2025-03-03 15:08:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:17,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:08:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:17,201 INFO L225 Difference]: With dead ends: 17845 [2025-03-03 15:08:17,201 INFO L226 Difference]: Without dead ends: 17553 [2025-03-03 15:08:17,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:17,208 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 4240 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4240 SdHoareTripleChecker+Valid, 3729 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:17,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4240 Valid, 3729 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3209 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:08:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17553 states. [2025-03-03 15:08:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17553 to 13778. [2025-03-03 15:08:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13776 states have (on average 1.4160133565621371) internal successors, (19507), 13777 states have internal predecessors, (19507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 19507 transitions. [2025-03-03 15:08:17,372 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 19507 transitions. Word has length 75 [2025-03-03 15:08:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:17,372 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 19507 transitions. [2025-03-03 15:08:17,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 19507 transitions. [2025-03-03 15:08:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:17,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:17,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:17,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:08:17,374 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:17,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash -61102624, now seen corresponding path program 1 times [2025-03-03 15:08:17,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:17,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803834084] [2025-03-03 15:08:17,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:17,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:17,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:17,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:17,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:17,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:17,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:17,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803834084] [2025-03-03 15:08:17,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803834084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:17,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:17,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823892215] [2025-03-03 15:08:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:17,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:17,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:17,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:17,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:17,664 INFO L87 Difference]: Start difference. First operand 13778 states and 19507 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:18,625 INFO L93 Difference]: Finished difference Result 17681 states and 24891 transitions. [2025-03-03 15:08:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:08:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:18,641 INFO L225 Difference]: With dead ends: 17681 [2025-03-03 15:08:18,641 INFO L226 Difference]: Without dead ends: 17465 [2025-03-03 15:08:18,645 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-03-03 15:08:18,645 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 6135 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6135 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:18,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6135 Valid, 2771 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:08:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17465 states. [2025-03-03 15:08:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17465 to 13773. [2025-03-03 15:08:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13773 states, 13771 states have (on average 1.415873937985622) internal successors, (19498), 13772 states have internal predecessors, (19498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13773 states to 13773 states and 19498 transitions. [2025-03-03 15:08:18,791 INFO L78 Accepts]: Start accepts. Automaton has 13773 states and 19498 transitions. Word has length 75 [2025-03-03 15:08:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:18,791 INFO L471 AbstractCegarLoop]: Abstraction has 13773 states and 19498 transitions. [2025-03-03 15:08:18,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 13773 states and 19498 transitions. [2025-03-03 15:08:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:18,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:18,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:18,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:08:18,794 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:18,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1816988076, now seen corresponding path program 1 times [2025-03-03 15:08:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:18,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121110297] [2025-03-03 15:08:18,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:18,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:18,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:18,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:18,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:18,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:18,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121110297] [2025-03-03 15:08:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121110297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:18,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:18,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:18,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368563754] [2025-03-03 15:08:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:18,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:18,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:18,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:18,954 INFO L87 Difference]: Start difference. First operand 13773 states and 19498 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:19,961 INFO L93 Difference]: Finished difference Result 17711 states and 24915 transitions. [2025-03-03 15:08:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:19,981 INFO L225 Difference]: With dead ends: 17711 [2025-03-03 15:08:19,981 INFO L226 Difference]: Without dead ends: 17475 [2025-03-03 15:08:19,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:19,988 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 5814 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5814 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:19,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5814 Valid, 2934 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:08:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17475 states. [2025-03-03 15:08:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17475 to 13773. [2025-03-03 15:08:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13773 states, 13771 states have (on average 1.4158013216178926) internal successors, (19497), 13772 states have internal predecessors, (19497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13773 states to 13773 states and 19497 transitions. [2025-03-03 15:08:20,185 INFO L78 Accepts]: Start accepts. Automaton has 13773 states and 19497 transitions. Word has length 76 [2025-03-03 15:08:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,185 INFO L471 AbstractCegarLoop]: Abstraction has 13773 states and 19497 transitions. [2025-03-03 15:08:20,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 13773 states and 19497 transitions. [2025-03-03 15:08:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:20,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:08:20,188 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:20,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1757458801, now seen corresponding path program 1 times [2025-03-03 15:08:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202140314] [2025-03-03 15:08:20,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:20,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:20,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:20,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:20,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:20,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:20,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:20,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202140314] [2025-03-03 15:08:20,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202140314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:20,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:20,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:20,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219389033] [2025-03-03 15:08:20,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:20,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:20,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:20,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:20,391 INFO L87 Difference]: Start difference. First operand 13773 states and 19497 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,369 INFO L93 Difference]: Finished difference Result 17679 states and 24884 transitions. [2025-03-03 15:08:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:21,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,381 INFO L225 Difference]: With dead ends: 17679 [2025-03-03 15:08:21,381 INFO L226 Difference]: Without dead ends: 17465 [2025-03-03 15:08:21,383 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-03-03 15:08:21,383 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 4505 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4505 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:21,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4505 Valid, 2822 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:08:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17465 states. [2025-03-03 15:08:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17465 to 13773. [2025-03-03 15:08:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13773 states, 13771 states have (on average 1.4157287052501635) internal successors, (19496), 13772 states have internal predecessors, (19496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13773 states to 13773 states and 19496 transitions. [2025-03-03 15:08:21,496 INFO L78 Accepts]: Start accepts. Automaton has 13773 states and 19496 transitions. Word has length 76 [2025-03-03 15:08:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,496 INFO L471 AbstractCegarLoop]: Abstraction has 13773 states and 19496 transitions. [2025-03-03 15:08:21,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13773 states and 19496 transitions. [2025-03-03 15:08:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:21,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:21,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:08:21,498 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:21,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash -733584693, now seen corresponding path program 1 times [2025-03-03 15:08:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556118488] [2025-03-03 15:08:21,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:21,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:21,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:21,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:21,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556118488] [2025-03-03 15:08:21,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556118488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:21,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:21,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:08:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571356621] [2025-03-03 15:08:21,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:21,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:21,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:21,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:21,750 INFO L87 Difference]: Start difference. First operand 13773 states and 19496 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:23,170 INFO L93 Difference]: Finished difference Result 41642 states and 58867 transitions. [2025-03-03 15:08:23,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 15:08:23,170 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:23,215 INFO L225 Difference]: With dead ends: 41642 [2025-03-03 15:08:23,215 INFO L226 Difference]: Without dead ends: 41425 [2025-03-03 15:08:23,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:08:23,229 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 9348 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9348 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:23,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9348 Valid, 2818 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:08:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41425 states. [2025-03-03 15:08:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41425 to 13778. [2025-03-03 15:08:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13776 states have (on average 1.4155778164924506) internal successors, (19501), 13777 states have internal predecessors, (19501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 19501 transitions. [2025-03-03 15:08:23,445 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 19501 transitions. Word has length 76 [2025-03-03 15:08:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:23,446 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 19501 transitions. [2025-03-03 15:08:23,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 19501 transitions. [2025-03-03 15:08:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:23,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:23,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:08:23,448 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:23,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1334782275, now seen corresponding path program 1 times [2025-03-03 15:08:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:23,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957308236] [2025-03-03 15:08:23,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:23,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:23,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:23,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:23,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:23,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957308236] [2025-03-03 15:08:23,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957308236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:23,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:23,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:23,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227392683] [2025-03-03 15:08:23,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:23,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:23,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:23,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:23,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:23,605 INFO L87 Difference]: Start difference. First operand 13778 states and 19501 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:24,563 INFO L93 Difference]: Finished difference Result 17716 states and 24918 transitions. [2025-03-03 15:08:24,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:24,581 INFO L225 Difference]: With dead ends: 17716 [2025-03-03 15:08:24,582 INFO L226 Difference]: Without dead ends: 17480 [2025-03-03 15:08:24,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:24,588 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 2811 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2811 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:24,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 2934 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:08:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17480 states. [2025-03-03 15:08:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17480 to 13778. [2025-03-03 15:08:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13776 states have (on average 1.4155052264808363) internal successors, (19500), 13777 states have internal predecessors, (19500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 19500 transitions. [2025-03-03 15:08:24,718 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 19500 transitions. Word has length 76 [2025-03-03 15:08:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:24,718 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 19500 transitions. [2025-03-03 15:08:24,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 19500 transitions. [2025-03-03 15:08:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:24,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:24,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:24,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:08:24,720 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:24,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash -863497822, now seen corresponding path program 1 times [2025-03-03 15:08:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023293661] [2025-03-03 15:08:24,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:24,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:24,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:24,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:24,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023293661] [2025-03-03 15:08:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023293661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:24,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:24,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251635238] [2025-03-03 15:08:24,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:24,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:24,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:24,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:24,856 INFO L87 Difference]: Start difference. First operand 13778 states and 19500 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:25,719 INFO L93 Difference]: Finished difference Result 17679 states and 24881 transitions. [2025-03-03 15:08:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:25,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:25,738 INFO L225 Difference]: With dead ends: 17679 [2025-03-03 15:08:25,738 INFO L226 Difference]: Without dead ends: 17465 [2025-03-03 15:08:25,743 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-03-03 15:08:25,744 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 2937 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2937 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:25,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2937 Valid, 2849 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:08:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17465 states. [2025-03-03 15:08:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17465 to 13778. [2025-03-03 15:08:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13776 states have (on average 1.4154326364692218) internal successors, (19499), 13777 states have internal predecessors, (19499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 19499 transitions. [2025-03-03 15:08:25,923 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 19499 transitions. Word has length 76 [2025-03-03 15:08:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:25,923 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 19499 transitions. [2025-03-03 15:08:25,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 19499 transitions. [2025-03-03 15:08:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:08:25,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:25,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:25,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:08:25,926 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:25,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1134666052, now seen corresponding path program 1 times [2025-03-03 15:08:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:25,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040790994] [2025-03-03 15:08:25,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:25,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:08:25,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:08:25,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:25,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:25,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:25,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040790994] [2025-03-03 15:08:25,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040790994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:25,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:25,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995953771] [2025-03-03 15:08:25,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:25,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:25,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:25,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:25,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:25,989 INFO L87 Difference]: Start difference. First operand 13778 states and 19499 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:26,093 INFO L93 Difference]: Finished difference Result 32600 states and 46750 transitions. [2025-03-03 15:08:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:26,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:08:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:26,114 INFO L225 Difference]: With dead ends: 32600 [2025-03-03 15:08:26,114 INFO L226 Difference]: Without dead ends: 20245 [2025-03-03 15:08:26,126 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-03-03 15:08:26,127 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 718 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:26,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1764 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20245 states. [2025-03-03 15:08:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20245 to 16261. [2025-03-03 15:08:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16261 states, 16259 states have (on average 1.4076511470570146) internal successors, (22887), 16260 states have internal predecessors, (22887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 22887 transitions. [2025-03-03 15:08:26,273 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 22887 transitions. Word has length 77 [2025-03-03 15:08:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:26,273 INFO L471 AbstractCegarLoop]: Abstraction has 16261 states and 22887 transitions. [2025-03-03 15:08:26,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 22887 transitions. [2025-03-03 15:08:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:08:26,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:26,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:26,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:08:26,275 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:26,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash -168197003, now seen corresponding path program 1 times [2025-03-03 15:08:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22576178] [2025-03-03 15:08:26,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:26,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:08:26,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:08:26,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:26,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22576178] [2025-03-03 15:08:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22576178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202520458] [2025-03-03 15:08:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:26,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:26,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:26,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:26,409 INFO L87 Difference]: Start difference. First operand 16261 states and 22887 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:27,310 INFO L93 Difference]: Finished difference Result 20755 states and 29020 transitions. [2025-03-03 15:08:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:27,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:08:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:27,329 INFO L225 Difference]: With dead ends: 20755 [2025-03-03 15:08:27,329 INFO L226 Difference]: Without dead ends: 20681 [2025-03-03 15:08:27,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:27,335 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 4385 mSDsluCounter, 2121 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4385 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:27,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4385 Valid, 2788 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:08:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20681 states. [2025-03-03 15:08:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20681 to 16256. [2025-03-03 15:08:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16256 states, 16254 states have (on average 1.4077150239940939) internal successors, (22881), 16255 states have internal predecessors, (22881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16256 states to 16256 states and 22881 transitions. [2025-03-03 15:08:27,490 INFO L78 Accepts]: Start accepts. Automaton has 16256 states and 22881 transitions. Word has length 77 [2025-03-03 15:08:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:27,490 INFO L471 AbstractCegarLoop]: Abstraction has 16256 states and 22881 transitions. [2025-03-03 15:08:27,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16256 states and 22881 transitions. [2025-03-03 15:08:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:27,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:27,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:08:27,492 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1235612092, now seen corresponding path program 1 times [2025-03-03 15:08:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216501038] [2025-03-03 15:08:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:27,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:27,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:27,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:27,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:27,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216501038] [2025-03-03 15:08:27,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216501038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:27,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:27,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:27,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887909237] [2025-03-03 15:08:27,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:27,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:27,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:27,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:27,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:27,828 INFO L87 Difference]: Start difference. First operand 16256 states and 22881 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:28,514 INFO L93 Difference]: Finished difference Result 27727 states and 39094 transitions. [2025-03-03 15:08:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:28,515 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:08:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:28,546 INFO L225 Difference]: With dead ends: 27727 [2025-03-03 15:08:28,546 INFO L226 Difference]: Without dead ends: 27658 [2025-03-03 15:08:28,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:28,556 INFO L435 NwaCegarLoop]: 1076 mSDtfsCounter, 6715 mSDsluCounter, 4621 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6715 SdHoareTripleChecker+Valid, 5697 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:28,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6715 Valid, 5697 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27658 states. [2025-03-03 15:08:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27658 to 16255. [2025-03-03 15:08:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16255 states, 16253 states have (on average 1.407678582415554) internal successors, (22879), 16254 states have internal predecessors, (22879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16255 states to 16255 states and 22879 transitions. [2025-03-03 15:08:28,774 INFO L78 Accepts]: Start accepts. Automaton has 16255 states and 22879 transitions. Word has length 78 [2025-03-03 15:08:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:28,774 INFO L471 AbstractCegarLoop]: Abstraction has 16255 states and 22879 transitions. [2025-03-03 15:08:28,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 16255 states and 22879 transitions. [2025-03-03 15:08:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:28,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:28,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:28,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:08:28,776 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:28,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1001091533, now seen corresponding path program 1 times [2025-03-03 15:08:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:28,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140602874] [2025-03-03 15:08:28,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:28,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:28,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:28,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:28,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140602874] [2025-03-03 15:08:29,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140602874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:29,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:29,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-03 15:08:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638462637] [2025-03-03 15:08:29,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:29,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 15:08:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:29,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 15:08:29,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:08:29,630 INFO L87 Difference]: Start difference. First operand 16255 states and 22879 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:33,230 INFO L93 Difference]: Finished difference Result 29783 states and 41755 transitions. [2025-03-03 15:08:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 15:08:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:08:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:33,260 INFO L225 Difference]: With dead ends: 29783 [2025-03-03 15:08:33,260 INFO L226 Difference]: Without dead ends: 29711 [2025-03-03 15:08:33,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 15:08:33,266 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 12550 mSDsluCounter, 18011 mSDsCounter, 0 mSdLazyCounter, 7086 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12550 SdHoareTripleChecker+Valid, 19226 SdHoareTripleChecker+Invalid, 7104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 7086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:33,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12550 Valid, 19226 Invalid, 7104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 7086 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 15:08:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29711 states. [2025-03-03 15:08:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29711 to 16272. [2025-03-03 15:08:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16272 states, 16270 states have (on average 1.407498463429625) internal successors, (22900), 16271 states have internal predecessors, (22900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16272 states to 16272 states and 22900 transitions. [2025-03-03 15:08:33,557 INFO L78 Accepts]: Start accepts. Automaton has 16272 states and 22900 transitions. Word has length 79 [2025-03-03 15:08:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:33,558 INFO L471 AbstractCegarLoop]: Abstraction has 16272 states and 22900 transitions. [2025-03-03 15:08:33,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 16272 states and 22900 transitions. [2025-03-03 15:08:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:33,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:33,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:33,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:08:33,561 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:33,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1025839395, now seen corresponding path program 1 times [2025-03-03 15:08:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:33,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35366200] [2025-03-03 15:08:33,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:33,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:33,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:33,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:33,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:33,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35366200] [2025-03-03 15:08:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35366200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666473937] [2025-03-03 15:08:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:33,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:33,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:33,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:33,977 INFO L87 Difference]: Start difference. First operand 16272 states and 22900 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:34,797 INFO L93 Difference]: Finished difference Result 20476 states and 28784 transitions. [2025-03-03 15:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:08:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:08:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:34,817 INFO L225 Difference]: With dead ends: 20476 [2025-03-03 15:08:34,817 INFO L226 Difference]: Without dead ends: 20369 [2025-03-03 15:08:34,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:34,824 INFO L435 NwaCegarLoop]: 1080 mSDtfsCounter, 5006 mSDsluCounter, 6246 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5006 SdHoareTripleChecker+Valid, 7326 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:34,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5006 Valid, 7326 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20369 states. [2025-03-03 15:08:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20369 to 16226. [2025-03-03 15:08:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16226 states, 16224 states have (on average 1.407914201183432) internal successors, (22842), 16225 states have internal predecessors, (22842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16226 states to 16226 states and 22842 transitions. [2025-03-03 15:08:35,026 INFO L78 Accepts]: Start accepts. Automaton has 16226 states and 22842 transitions. Word has length 79 [2025-03-03 15:08:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:35,026 INFO L471 AbstractCegarLoop]: Abstraction has 16226 states and 22842 transitions. [2025-03-03 15:08:35,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 16226 states and 22842 transitions. [2025-03-03 15:08:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:35,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:35,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:35,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:08:35,029 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:35,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1699116517, now seen corresponding path program 1 times [2025-03-03 15:08:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197686469] [2025-03-03 15:08:35,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:35,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:35,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:35,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:35,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:35,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:35,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197686469] [2025-03-03 15:08:35,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197686469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:35,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:35,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:35,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092809337] [2025-03-03 15:08:35,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:35,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:35,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:35,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:35,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:35,409 INFO L87 Difference]: Start difference. First operand 16226 states and 22842 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:36,017 INFO L93 Difference]: Finished difference Result 27613 states and 38949 transitions. [2025-03-03 15:08:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:36,018 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:08:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:36,049 INFO L225 Difference]: With dead ends: 27613 [2025-03-03 15:08:36,049 INFO L226 Difference]: Without dead ends: 27478 [2025-03-03 15:08:36,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:36,059 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 5027 mSDsluCounter, 4400 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5027 SdHoareTripleChecker+Valid, 5362 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:36,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5027 Valid, 5362 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27478 states. [2025-03-03 15:08:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27478 to 16159. [2025-03-03 15:08:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16159 states, 16158 states have (on average 1.4083426166604778) internal successors, (22756), 16158 states have internal predecessors, (22756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16159 states to 16159 states and 22756 transitions. [2025-03-03 15:08:36,248 INFO L78 Accepts]: Start accepts. Automaton has 16159 states and 22756 transitions. Word has length 79 [2025-03-03 15:08:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,248 INFO L471 AbstractCegarLoop]: Abstraction has 16159 states and 22756 transitions. [2025-03-03 15:08:36,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 16159 states and 22756 transitions. [2025-03-03 15:08:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:08:36,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:36,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:08:36,250 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:36,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash -805472261, now seen corresponding path program 1 times [2025-03-03 15:08:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702632526] [2025-03-03 15:08:36,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:08:36,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:08:36,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:36,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:36,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:36,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702632526] [2025-03-03 15:08:36,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702632526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:36,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:36,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108756625] [2025-03-03 15:08:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:36,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:36,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:36,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:36,325 INFO L87 Difference]: Start difference. First operand 16159 states and 22756 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:36,572 INFO L93 Difference]: Finished difference Result 62061 states and 88141 transitions. [2025-03-03 15:08:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 15:08:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:36,617 INFO L225 Difference]: With dead ends: 62061 [2025-03-03 15:08:36,618 INFO L226 Difference]: Without dead ends: 47083 [2025-03-03 15:08:36,626 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-03-03 15:08:36,627 INFO L435 NwaCegarLoop]: 1066 mSDtfsCounter, 3844 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3844 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:36,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3844 Valid, 2261 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47083 states. [2025-03-03 15:08:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47083 to 30319. [2025-03-03 15:08:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30319 states, 30318 states have (on average 1.4010158981463157) internal successors, (42476), 30318 states have internal predecessors, (42476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30319 states to 30319 states and 42476 transitions. [2025-03-03 15:08:37,010 INFO L78 Accepts]: Start accepts. Automaton has 30319 states and 42476 transitions. Word has length 80 [2025-03-03 15:08:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:37,010 INFO L471 AbstractCegarLoop]: Abstraction has 30319 states and 42476 transitions. [2025-03-03 15:08:37,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30319 states and 42476 transitions. [2025-03-03 15:08:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:08:37,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:37,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:37,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:08:37,014 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:37,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash 786968663, now seen corresponding path program 1 times [2025-03-03 15:08:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280394788] [2025-03-03 15:08:37,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:37,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:08:37,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:08:37,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:37,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:37,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280394788] [2025-03-03 15:08:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280394788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:37,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963720170] [2025-03-03 15:08:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:37,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:37,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:37,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:37,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:37,103 INFO L87 Difference]: Start difference. First operand 30319 states and 42476 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:37,308 INFO L93 Difference]: Finished difference Result 51207 states and 71780 transitions. [2025-03-03 15:08:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:37,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 15:08:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:37,335 INFO L225 Difference]: With dead ends: 51207 [2025-03-03 15:08:37,335 INFO L226 Difference]: Without dead ends: 22044 [2025-03-03 15:08:37,355 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-03-03 15:08:37,356 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 2812 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2812 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:37,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2812 Valid, 1759 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22044 states. [2025-03-03 15:08:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22044 to 22038. [2025-03-03 15:08:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22038 states, 22037 states have (on average 1.38811998003358) internal successors, (30590), 22037 states have internal predecessors, (30590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22038 states to 22038 states and 30590 transitions. [2025-03-03 15:08:37,561 INFO L78 Accepts]: Start accepts. Automaton has 22038 states and 30590 transitions. Word has length 81 [2025-03-03 15:08:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:37,561 INFO L471 AbstractCegarLoop]: Abstraction has 22038 states and 30590 transitions. [2025-03-03 15:08:37,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22038 states and 30590 transitions. [2025-03-03 15:08:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:08:37,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:37,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:37,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:08:37,565 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:37,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -482772668, now seen corresponding path program 1 times [2025-03-03 15:08:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690327828] [2025-03-03 15:08:37,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:37,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:08:37,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:08:37,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:37,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690327828] [2025-03-03 15:08:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690327828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:37,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:37,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199911810] [2025-03-03 15:08:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:37,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:37,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:37,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:37,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:37,678 INFO L87 Difference]: Start difference. First operand 22038 states and 30590 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:37,811 INFO L93 Difference]: Finished difference Result 62348 states and 86836 transitions. [2025-03-03 15:08:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-03 15:08:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:37,851 INFO L225 Difference]: With dead ends: 62348 [2025-03-03 15:08:37,851 INFO L226 Difference]: Without dead ends: 41466 [2025-03-03 15:08:37,873 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-03-03 15:08:37,873 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 552 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:37,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1568 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41466 states. [2025-03-03 15:08:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41466 to 39512. [2025-03-03 15:08:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39512 states, 39511 states have (on average 1.3815393181645617) internal successors, (54586), 39511 states have internal predecessors, (54586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39512 states to 39512 states and 54586 transitions. [2025-03-03 15:08:38,260 INFO L78 Accepts]: Start accepts. Automaton has 39512 states and 54586 transitions. Word has length 83 [2025-03-03 15:08:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:38,260 INFO L471 AbstractCegarLoop]: Abstraction has 39512 states and 54586 transitions. [2025-03-03 15:08:38,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 39512 states and 54586 transitions. [2025-03-03 15:08:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:08:38,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:38,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:38,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:08:38,263 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:38,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1239604510, now seen corresponding path program 1 times [2025-03-03 15:08:38,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:38,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836864582] [2025-03-03 15:08:38,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:38,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:08:38,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:08:38,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:38,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836864582] [2025-03-03 15:08:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836864582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:38,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:38,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885871441] [2025-03-03 15:08:38,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:38,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:38,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:38,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:38,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:38,333 INFO L87 Difference]: Start difference. First operand 39512 states and 54586 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-03-03 15:08:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:38,576 INFO L93 Difference]: Finished difference Result 113316 states and 156468 transitions. [2025-03-03 15:08:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:38,577 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-03-03 15:08:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:38,660 INFO L225 Difference]: With dead ends: 113316 [2025-03-03 15:08:38,660 INFO L226 Difference]: Without dead ends: 74960 [2025-03-03 15:08:38,699 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-03-03 15:08:38,699 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 416 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:38,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1662 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74960 states. [2025-03-03 15:08:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74960 to 71054. [2025-03-03 15:08:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71054 states, 71053 states have (on average 1.3690343827846818) internal successors, (97274), 71053 states have internal predecessors, (97274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71054 states to 71054 states and 97274 transitions. [2025-03-03 15:08:39,677 INFO L78 Accepts]: Start accepts. Automaton has 71054 states and 97274 transitions. Word has length 86 [2025-03-03 15:08:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:39,677 INFO L471 AbstractCegarLoop]: Abstraction has 71054 states and 97274 transitions. [2025-03-03 15:08:39,677 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-03-03 15:08:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 71054 states and 97274 transitions. [2025-03-03 15:08:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:08:39,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:39,680 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-03-03 15:08:39,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:08:39,680 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:39,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1674011420, now seen corresponding path program 1 times [2025-03-03 15:08:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:39,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427903052] [2025-03-03 15:08:39,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:39,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:08:39,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:08:39,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:39,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:39,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-03-03 15:08:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:39,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427903052] [2025-03-03 15:08:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427903052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:39,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:39,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253060472] [2025-03-03 15:08:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:39,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:39,835 INFO L87 Difference]: Start difference. First operand 71054 states and 97274 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-03-03 15:08:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:40,056 INFO L93 Difference]: Finished difference Result 75256 states and 102875 transitions. [2025-03-03 15:08:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-03-03 15:08:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:40,141 INFO L225 Difference]: With dead ends: 75256 [2025-03-03 15:08:40,141 INFO L226 Difference]: Without dead ends: 75254 [2025-03-03 15:08:40,165 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-03-03 15:08:40,166 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 0 mSDsluCounter, 3993 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5015 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:40,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5015 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75254 states. [2025-03-03 15:08:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75254 to 75254. [2025-03-03 15:08:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75254 states, 75253 states have (on average 1.3484379360291283) internal successors, (101474), 75253 states have internal predecessors, (101474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75254 states to 75254 states and 101474 transitions. [2025-03-03 15:08:41,228 INFO L78 Accepts]: Start accepts. Automaton has 75254 states and 101474 transitions. Word has length 87 [2025-03-03 15:08:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:41,228 INFO L471 AbstractCegarLoop]: Abstraction has 75254 states and 101474 transitions. [2025-03-03 15:08:41,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-03-03 15:08:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 75254 states and 101474 transitions. [2025-03-03 15:08:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:08:41,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:41,231 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-03-03 15:08:41,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:08:41,232 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:41,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash -249730802, now seen corresponding path program 1 times [2025-03-03 15:08:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:41,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805783921] [2025-03-03 15:08:41,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:41,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:08:41,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:08:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:41,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:41,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805783921] [2025-03-03 15:08:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805783921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:41,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564802291] [2025-03-03 15:08:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:41,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:41,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:41,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:41,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:41,273 INFO L87 Difference]: Start difference. First operand 75254 states and 101474 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-03-03 15:08:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:41,672 INFO L93 Difference]: Finished difference Result 212038 states and 285424 transitions. [2025-03-03 15:08:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:41,672 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-03-03 15:08:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:42,085 INFO L225 Difference]: With dead ends: 212038 [2025-03-03 15:08:42,085 INFO L226 Difference]: Without dead ends: 137940 [2025-03-03 15:08:42,122 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-03-03 15:08:42,122 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 483 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:42,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1575 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137940 states. [2025-03-03 15:08:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137940 to 137938. [2025-03-03 15:08:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137938 states, 137937 states have (on average 1.3327678577901505) internal successors, (183838), 137937 states have internal predecessors, (183838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137938 states to 137938 states and 183838 transitions. [2025-03-03 15:08:43,715 INFO L78 Accepts]: Start accepts. Automaton has 137938 states and 183838 transitions. Word has length 88 [2025-03-03 15:08:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:43,715 INFO L471 AbstractCegarLoop]: Abstraction has 137938 states and 183838 transitions. [2025-03-03 15:08:43,715 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-03-03 15:08:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 137938 states and 183838 transitions. [2025-03-03 15:08:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:08:43,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:43,719 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-03-03 15:08:43,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:08:43,719 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1975191538, now seen corresponding path program 1 times [2025-03-03 15:08:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:43,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454909677] [2025-03-03 15:08:43,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:43,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:08:43,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:08:43,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:44,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:44,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454909677] [2025-03-03 15:08:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454909677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714468057] [2025-03-03 15:08:44,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:44,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:44,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:44,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:44,029 INFO L87 Difference]: Start difference. First operand 137938 states and 183838 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-03-03 15:08:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:44,751 INFO L93 Difference]: Finished difference Result 272812 states and 364475 transitions. [2025-03-03 15:08:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:44,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-03-03 15:08:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:45,042 INFO L225 Difference]: With dead ends: 272812 [2025-03-03 15:08:45,042 INFO L226 Difference]: Without dead ends: 231866 [2025-03-03 15:08:45,102 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-03-03 15:08:45,103 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 3015 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3015 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:45,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3015 Valid, 2771 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231866 states. [2025-03-03 15:08:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231866 to 174760. [2025-03-03 15:08:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174760 states, 174759 states have (on average 1.3298771450969622) internal successors, (232408), 174759 states have internal predecessors, (232408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174760 states to 174760 states and 232408 transitions. [2025-03-03 15:08:47,762 INFO L78 Accepts]: Start accepts. Automaton has 174760 states and 232408 transitions. Word has length 90 [2025-03-03 15:08:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:47,763 INFO L471 AbstractCegarLoop]: Abstraction has 174760 states and 232408 transitions. [2025-03-03 15:08:47,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-03-03 15:08:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 174760 states and 232408 transitions. [2025-03-03 15:08:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:08:47,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:47,767 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] [2025-03-03 15:08:47,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:08:47,767 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:47,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash 815958698, now seen corresponding path program 1 times [2025-03-03 15:08:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:47,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581838235] [2025-03-03 15:08:47,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:47,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:08:47,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:08:47,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:47,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:47,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:47,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581838235] [2025-03-03 15:08:47,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581838235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:47,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722441348] [2025-03-03 15:08:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:47,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:47,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:47,816 INFO L87 Difference]: Start difference. First operand 174760 states and 232408 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:48,546 INFO L93 Difference]: Finished difference Result 213968 states and 283842 transitions. [2025-03-03 15:08:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:08:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:48,732 INFO L225 Difference]: With dead ends: 213968 [2025-03-03 15:08:48,732 INFO L226 Difference]: Without dead ends: 135558 [2025-03-03 15:08:48,794 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-03-03 15:08:48,795 INFO L435 NwaCegarLoop]: 1058 mSDtfsCounter, 396 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:48,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1741 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135558 states. [2025-03-03 15:08:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135558 to 134812. [2025-03-03 15:08:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134812 states, 134811 states have (on average 1.3090919880425187) internal successors, (176480), 134811 states have internal predecessors, (176480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134812 states to 134812 states and 176480 transitions. [2025-03-03 15:08:50,387 INFO L78 Accepts]: Start accepts. Automaton has 134812 states and 176480 transitions. Word has length 92 [2025-03-03 15:08:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:50,388 INFO L471 AbstractCegarLoop]: Abstraction has 134812 states and 176480 transitions. [2025-03-03 15:08:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 134812 states and 176480 transitions. [2025-03-03 15:08:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:08:50,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:50,391 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-03-03 15:08:50,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:08:50,391 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:50,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 181575042, now seen corresponding path program 1 times [2025-03-03 15:08:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:50,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372491868] [2025-03-03 15:08:50,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:50,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:50,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:08:50,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:08:50,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:50,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:50,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:50,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372491868] [2025-03-03 15:08:50,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372491868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:50,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:50,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:50,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610148205] [2025-03-03 15:08:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:50,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:50,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:50,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:50,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:50,768 INFO L87 Difference]: Start difference. First operand 134812 states and 176480 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) 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-03-03 15:08:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:52,264 INFO L93 Difference]: Finished difference Result 311456 states and 410210 transitions. [2025-03-03 15:08:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:52,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) 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-03-03 15:08:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:52,614 INFO L225 Difference]: With dead ends: 311456 [2025-03-03 15:08:52,614 INFO L226 Difference]: Without dead ends: 247902 [2025-03-03 15:08:52,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:52,666 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 4515 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4515 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:52,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4515 Valid, 1296 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:08:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247902 states. [2025-03-03 15:08:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247902 to 157644. [2025-03-03 15:08:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157644 states, 157643 states have (on average 1.3002543722207773) internal successors, (204976), 157643 states have internal predecessors, (204976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157644 states to 157644 states and 204976 transitions. [2025-03-03 15:08:55,131 INFO L78 Accepts]: Start accepts. Automaton has 157644 states and 204976 transitions. Word has length 93 [2025-03-03 15:08:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:55,131 INFO L471 AbstractCegarLoop]: Abstraction has 157644 states and 204976 transitions. [2025-03-03 15:08:55,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) 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-03-03 15:08:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 157644 states and 204976 transitions. [2025-03-03 15:08:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:08:55,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:55,135 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-03-03 15:08:55,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:08:55,135 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:55,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1785169229, now seen corresponding path program 1 times [2025-03-03 15:08:55,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:55,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50948828] [2025-03-03 15:08:55,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:55,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:55,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:08:55,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:08:55,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:55,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:55,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50948828] [2025-03-03 15:08:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50948828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:55,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339620004] [2025-03-03 15:08:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:55,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:55,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:55,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:55,220 INFO L87 Difference]: Start difference. First operand 157644 states and 204976 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-03-03 15:08:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:55,841 INFO L93 Difference]: Finished difference Result 262536 states and 342767 transitions. [2025-03-03 15:08:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:55,841 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-03-03 15:08:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:56,108 INFO L225 Difference]: With dead ends: 262536 [2025-03-03 15:08:56,108 INFO L226 Difference]: Without dead ends: 225470 [2025-03-03 15:08:56,189 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-03-03 15:08:56,189 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 2923 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2923 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:56,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2923 Valid, 2849 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]