./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.UNBOUNDED.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 7853b3826176a0fe575c35877885ca2c640283bf6a2200e21b7819452b726d2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:26:52,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:26:52,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:26:52,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:26:52,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:26:52,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:26:52,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:26:52,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:26:52,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:26:52,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:26:52,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:26:52,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:26:52,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:26:52,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:26:52,737 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:26:52,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:26:52,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:26:52,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:26:52,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:26:52,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:26:52,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:26:52,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:26:52,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:26:52,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:26:52,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:26:52,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:26:52,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:26:52,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:26:52,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:26:52,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:26:52,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:26:52,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:26:52,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:52,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:26:52,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:26:52,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:26:52,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:26:52,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:26:52,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:26:52,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:26:52,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:26:52,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:26:52,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:26:52,741 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 -> 7853b3826176a0fe575c35877885ca2c640283bf6a2200e21b7819452b726d2c [2025-03-16 19:26:52,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:26:52,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:26:52,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:26:52,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:26:52,973 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:26:52,974 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.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:26:54,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66827719d/fa382ba71c90413f86001c88dc524c49/FLAG4d0af7641 [2025-03-16 19:26:54,567 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:26:54,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:26:54,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66827719d/fa382ba71c90413f86001c88dc524c49/FLAG4d0af7641 [2025-03-16 19:26:54,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66827719d/fa382ba71c90413f86001c88dc524c49 [2025-03-16 19:26:54,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:26:54,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:26:54,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:54,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:26:54,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:26:54,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:54" (1/1) ... [2025-03-16 19:26:54,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35aaa9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:54, skipping insertion in model container [2025-03-16 19:26:54,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:54" (1/1) ... [2025-03-16 19:26:54,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:26:55,028 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.UNBOUNDED.pals.c.v+sep-reducer.c[28933,28946] [2025-03-16 19:26:55,087 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.UNBOUNDED.pals.c.v+sep-reducer.c[50969,50982] [2025-03-16 19:26:55,104 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.UNBOUNDED.pals.c.v+sep-reducer.c[58695,58708] [2025-03-16 19:26:55,152 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.UNBOUNDED.pals.c.v+sep-reducer.c[83802,83815] [2025-03-16 19:26:55,178 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.UNBOUNDED.pals.c.v+sep-reducer.c[98975,98988] [2025-03-16 19:26:55,201 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.UNBOUNDED.pals.c.v+sep-reducer.c[115686,115699] [2025-03-16 19:26:55,226 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.UNBOUNDED.pals.c.v+sep-reducer.c[132053,132066] [2025-03-16 19:26:55,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:55,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:26:55,441 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.UNBOUNDED.pals.c.v+sep-reducer.c[28933,28946] [2025-03-16 19:26:55,478 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.UNBOUNDED.pals.c.v+sep-reducer.c[50969,50982] [2025-03-16 19:26:55,491 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.UNBOUNDED.pals.c.v+sep-reducer.c[58695,58708] [2025-03-16 19:26:55,517 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.UNBOUNDED.pals.c.v+sep-reducer.c[83802,83815] [2025-03-16 19:26:55,533 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.UNBOUNDED.pals.c.v+sep-reducer.c[98975,98988] [2025-03-16 19:26:55,550 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.UNBOUNDED.pals.c.v+sep-reducer.c[115686,115699] [2025-03-16 19:26:55,566 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.UNBOUNDED.pals.c.v+sep-reducer.c[132053,132066] [2025-03-16 19:26:55,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:55,683 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:26:55,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55 WrapperNode [2025-03-16 19:26:55,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:55,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:55,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:26:55,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:26:55,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:55,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:55,859 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9849 [2025-03-16 19:26:55,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:55,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:26:55,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:26:55,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:26:55,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:55,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:55,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:55,988 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-16 19:26:55,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:55,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:56,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:56,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:56,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:56,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:56,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:26:56,092 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:26:56,092 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:26:56,092 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:26:56,093 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (1/1) ... [2025-03-16 19:26:56,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:26:56,117 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-16 19:26:56,119 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-16 19:26:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:26:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:26:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:26:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:26:56,458 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:26:56,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:27:00,153 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9747: havoc main_~node4__m4~55#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-03-16 19:27:00,154 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15032: havoc main_~node4__m4~81#1; [2025-03-16 19:27:00,154 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9219: havoc main_~node4__m4~52#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-16 19:27:00,154 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13448: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:27:00,154 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13713: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-16 19:27:00,154 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2088: havoc main_~node2__m2~6#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~9#1; [2025-03-16 19:27:00,155 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15301: havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-16 19:27:00,155 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10545: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:27:00,155 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148: havoc main_~node3__m3~20#1; [2025-03-16 19:27:00,155 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6056: havoc main_~node2__m2~20#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3680: havoc main_~node2__m2~13#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10555: havoc main_~node3__m3~63#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3420: havoc main_~node2__m2~12#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~15#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7384: havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L780: havoc main_~check__tmp~1#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc main_~node2__m2~8#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8447: havoc main_~node4__m4~48#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13205: havoc main_~node3__m3~76#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3956: havoc main_~node2__m2~14#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6600: havoc main_~node4__m4~37#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10565: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L260: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6339: havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13741: havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10574: havoc main_~node4__m4~60#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12688: havoc main_~node1____CPAchecker_TMP_0~17#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3442: havoc main_~node3__m3~23#1; [2025-03-16 19:27:00,156 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5294: havoc main_~node2__m2~18#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~27#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2652: havoc main_~node3__m3~15#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917: havoc main_~node3__m3~18#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7147: havoc main_~node1____CPAchecker_TMP_0~6#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~46#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10847: havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12171: havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14553: havoc main_~node2__m2~56#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~84#1;havoc main_~node4__m4~79#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~60#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~83#1;havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4778: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~33#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4254: havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5577: havoc main_~node1____CPAchecker_TMP_0~4#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~37#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14563: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4521: havoc main_~node4__m4~23#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9542: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~32#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14299: havoc main_~node4__m4~77#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~82#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9278: havoc main_~node1__m1~33#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1;havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7694: havoc main_~node1____CPAchecker_TMP_0~9#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~49#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409: havoc main_~node4__m4~14#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5847: havoc main_~check__tmp~31#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~38#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13247: havoc main_~node4__m4~73#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11398: havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:27:00,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3207: havoc main_~node2__m2~11#1; [2025-03-16 19:27:00,158 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12985: havoc main_~node4__m4~71#1; [2025-03-16 19:27:00,158 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11933: havoc main_~node3__m3~69#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~70#1; [2025-03-16 19:27:00,158 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6123: havoc main_~check__tmp~33#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~40#1; [2025-03-16 19:27:00,158 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9823: havoc main_~node4__m4~56#1; [2025-03-16 19:27:00,159 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1367: havoc main_~node4__m4~7#1; [2025-03-16 19:27:00,159 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: havoc main_~node3__m3~0#1; [2025-03-16 19:27:00,159 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3747: havoc main_~check__tmp~17#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~26#1; [2025-03-16 19:27:00,162 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11676: havoc main_~node4__m4~66#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14847: havoc main_~node2__m2~58#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~86#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~85#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8506: havoc main_~node1__m1~28#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1;havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2166: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~10#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6659: havoc main_~node1__m1~19#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1;havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925: havoc main_~node1____CPAchecker_TMP_0~5#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~45#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16968: havoc main_~node2__m2~70#1;havoc main_~node1__m1~77#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~100#1;havoc main_~node4__m4~92#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~76#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~99#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14591: havoc main_~node2____CPAchecker_TMP_1~4#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16441: havoc main_~node4__m4~89#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~73#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~96#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229: havoc main_~node3__m3~21#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494: havoc main_~node3__m3~24#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7458: havoc main_~node2__m2~24#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14857: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118: havoc main_~node2__m2~3#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~3#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8253: havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2704: havoc main_~node3__m3~16#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16711: havoc main_~node2____CPAchecker_TMP_1~9#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~75#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~98#1;havoc main_~node4__m4~91#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~74#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~97#1;havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13541: havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: havoc main_~node4__m4~0#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1655: havoc main_~check__tmp~6#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6413: havoc main_~node2__m2~21#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4035: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~28#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~8#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16984: havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-03-16 19:27:00,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15403: havoc main_~node4__m4~83#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~89#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8004: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~51#1;havoc main_~node2__m2~25#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14084: havoc main_~node1____CPAchecker_TMP_0~18#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~81#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~80#1;havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986: havoc main_~node4__m4~15#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13294: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6688: havoc main_~node2__m2~22#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14885: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15678: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~68#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~91#1;havoc main_~node4__m4~85#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~67#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4844: havoc main_~node2__m2~17#1; [2025-03-16 19:27:00,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4580: havoc main_~node1__m1~11#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-16 19:27:00,165 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2468: havoc main_~node1__m1~5#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:27:00,165 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15951: havoc main_~node2____CPAchecker_TMP_1~8#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~70#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~93#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~69#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~92#1; [2025-03-16 19:27:00,165 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17011: havoc main_~node3__m3~91#1; [2025-03-16 19:27:00,165 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4328: havoc main_~node2__m2~15#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~21#1; [2025-03-16 19:27:00,165 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12259: havoc main_~node3__m3~71#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~72#1; [2025-03-16 19:27:00,165 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9882: havoc main_~node1__m1~35#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1;havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-16 19:27:00,165 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:27:00,165 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1162: havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14375: havoc main_~node4__m4~78#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12526: havoc main_~node1__m1~51#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~74#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~73#1;havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6450: havoc main_~node4__m4~35#1;havoc main_~node3__m3~42#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5129: havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~26#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~35#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13322: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3281: havoc main_~node3__m3~22#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12002: havoc main_~node4__m4~67#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12800: havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13858: havoc main_~node4__m4~75#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4609: havoc main_~node2__m2~16#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16238: havoc main_~node1__m1~72#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~95#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~87#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~71#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2497: havoc main_~node2__m2~7#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9105: havoc main_~node1____CPAchecker_TMP_0~12#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1;havoc main_~node4__m4~51#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9635: havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10957: havoc main_~node4__m4~62#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10433: havoc main_~node1____CPAchecker_TMP_0~15#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~61#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~60#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7792: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8849: havoc main_~node1____CPAchecker_TMP_0~11#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~29#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16517: havoc main_~node4__m4~90#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1455: havoc main_~node2__m2~4#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10178: havoc main_~node1____CPAchecker_TMP_0~14#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~59#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~35#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9386: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~31#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc main_~node4__m4~21#1;havoc main_~node3__m3~30#1; [2025-03-16 19:27:00,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15200: havoc main_~node1__m1~65#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~88#1;havoc main_~node4__m4~82#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~87#1;havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-16 19:27:00,167 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3573: havoc main_~node3__m3~25#1; [2025-03-16 19:27:00,171 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3045: havoc main_~node1__m1~7#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~14#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7010: havoc main_~node2__m2~23#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~node3__m3~13#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5692: havoc main_~node4__m4~30#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13357: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17058: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731: havoc main_~node2__m2~5#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5431: havoc main_~node1____CPAchecker_TMP_0~3#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~28#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~36#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3583: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~check__tmp~2#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7548: havoc main_~node1____CPAchecker_TMP_0~8#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~48#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14684: havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11780: havoc main_~node3__m3~68#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~69#1;havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6759: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~44#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L417: havoc main_~node2__m2~1#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7818: havoc main_~node3__m3~50#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3592: havoc main_~node4__m4~16#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12577: havoc main_~node2__m2~47#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16806: havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15485: havoc main_~node4__m4~84#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7293: havoc main_~node1____CPAchecker_TMP_0~7#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~47#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2014: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7828: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5980: havoc main_~check__tmp~32#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~39#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074: havoc main_~node2__m2~10#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6246: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~41#1; [2025-03-16 19:27:00,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10741: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~63#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13385: havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8365: havoc main_~node4__m4~47#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7837: havoc main_~node4__m4~44#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17086: havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3346: havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: havoc main_~node2__m2~2#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2292: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3880: havoc main_~check__tmp~18#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~27#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15773: havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6524: havoc main_~node4__m4~36#1;havoc main_~node3__m3~43#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12338: havoc main_~node3__m3~72#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11286: havoc main_~node1____CPAchecker_TMP_0~16#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~66#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1;havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4680: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~23#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~32#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11551: havoc main_~node1__m1~45#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~68#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~67#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14987: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3096: havoc main_~node3__m3~19#1; [2025-03-16 19:27:00,173 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14196: havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12348: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571: havoc main_~node3__m3~14#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L461: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4161: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~20#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~29#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5220: havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2843: havoc main_~node2__m2~9#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~13#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1522: havoc main_~check__tmp~5#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12357: havoc main_~node4__m4~68#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5751: havoc main_~node1__m1~17#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12624: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264: havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13420: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4439: havoc main_~node4__m4~22#1;havoc main_~node3__m3~31#1; [2025-03-16 19:27:00,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1798: havoc main_~check__tmp~7#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~9#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13163: havoc main_~node2__m2~50#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~77#1;havoc main_~node4__m4~72#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~76#1;havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12106: havoc main_~node3__m3~70#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~71#1;havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15013: havoc main_~node3__m3~82#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16070: havoc main_~node4__m4~87#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3651: havoc main_~node1__m1~9#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8673: havoc main_~node1____CPAchecker_TMP_0~10#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~28#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11845: havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12903: havoc main_~node4__m4~70#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~75#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16339: havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8940: havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2865: havoc main_~node3__m3~17#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10002: havoc main_~node1____CPAchecker_TMP_0~13#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~34#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15023: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11060: havoc main_~node4__m4~63#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13703: havoc main_~node2__m2~52#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~79#1;havoc main_~node4__m4~74#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~78#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10268: havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4983: havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~34#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10535: havoc main_~node2__m2~37#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5780: havoc main_~node2__m2~19#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12652: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8160: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~26#1; [2025-03-16 19:27:00,177 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7896: havoc main_~node1__m1~26#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1;havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-16 19:27:00,511 INFO L? ?]: Removed 1723 outVars from TransFormulas that were not future-live. [2025-03-16 19:27:00,512 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:27:00,556 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:27:00,557 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:27:00,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:27:00 BoogieIcfgContainer [2025-03-16 19:27:00,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:27:00,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:27:00,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:27:00,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:27:00,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:26:54" (1/3) ... [2025-03-16 19:27:00,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b01ee3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:27:00, skipping insertion in model container [2025-03-16 19:27:00,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:55" (2/3) ... [2025-03-16 19:27:00,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b01ee3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:27:00, skipping insertion in model container [2025-03-16 19:27:00,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:27:00" (3/3) ... [2025-03-16 19:27:00,566 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:27:00,577 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:27:00,582 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 2028 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-16 19:27:00,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:27:00,680 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;@64b0b06b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:27:00,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-16 19:27:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 2028 states, 2020 states have (on average 1.799009900990099) internal successors, (3634), 2027 states have internal predecessors, (3634), 0 states have call successors, (0), 0 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-16 19:27:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:27:00,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:00,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:00,718 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-16 19:27:00,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:00,722 INFO L85 PathProgramCache]: Analyzing trace with hash 868308359, now seen corresponding path program 1 times [2025-03-16 19:27:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629454549] [2025-03-16 19:27:00,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:00,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:27:00,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:27:00,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:00,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:01,228 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-16 19:27:01,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:01,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629454549] [2025-03-16 19:27:01,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629454549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:01,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:27:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700079467] [2025-03-16 19:27:01,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:01,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:27:01,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:01,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:27:01,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:27:01,261 INFO L87 Difference]: Start difference. First operand has 2028 states, 2020 states have (on average 1.799009900990099) internal successors, (3634), 2027 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:03,262 INFO L93 Difference]: Finished difference Result 3989 states and 7066 transitions. [2025-03-16 19:27:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:27:03,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:27:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:03,289 INFO L225 Difference]: With dead ends: 3989 [2025-03-16 19:27:03,289 INFO L226 Difference]: Without dead ends: 2652 [2025-03-16 19:27:03,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:27:03,301 INFO L435 NwaCegarLoop]: 1969 mSDtfsCounter, 12896 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12896 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:03,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12896 Valid, 2578 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 19:27:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2025-03-16 19:27:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2646. [2025-03-16 19:27:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2639 states have (on average 1.332322849564229) internal successors, (3516), 2645 states have internal predecessors, (3516), 0 states have call successors, (0), 0 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-16 19:27:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3516 transitions. [2025-03-16 19:27:03,429 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 3516 transitions. Word has length 63 [2025-03-16 19:27:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:03,429 INFO L471 AbstractCegarLoop]: Abstraction has 2646 states and 3516 transitions. [2025-03-16 19:27:03,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3516 transitions. [2025-03-16 19:27:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:27:03,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:03,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:03,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:27:03,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:03,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1938795037, now seen corresponding path program 1 times [2025-03-16 19:27:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:03,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557694704] [2025-03-16 19:27:03,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:27:03,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:27:03,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:03,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:03,667 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-16 19:27:03,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:03,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557694704] [2025-03-16 19:27:03,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557694704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:03,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:03,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:27:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679169774] [2025-03-16 19:27:03,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:03,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:27:03,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:03,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:27:03,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:27:03,673 INFO L87 Difference]: Start difference. First operand 2646 states and 3516 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:04,927 INFO L93 Difference]: Finished difference Result 4534 states and 6096 transitions. [2025-03-16 19:27:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:27:04,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:27:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:04,937 INFO L225 Difference]: With dead ends: 4534 [2025-03-16 19:27:04,937 INFO L226 Difference]: Without dead ends: 2929 [2025-03-16 19:27:04,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:27:04,940 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 7798 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7798 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:04,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7798 Valid, 1462 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:27:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2025-03-16 19:27:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2916. [2025-03-16 19:27:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2909 states have (on average 1.3547610862839463) internal successors, (3941), 2915 states have internal predecessors, (3941), 0 states have call successors, (0), 0 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-16 19:27:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3941 transitions. [2025-03-16 19:27:04,999 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3941 transitions. Word has length 64 [2025-03-16 19:27:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:04,999 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 3941 transitions. [2025-03-16 19:27:04,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3941 transitions. [2025-03-16 19:27:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:27:05,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:05,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:27:05,004 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-16 19:27:05,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash -21445536, now seen corresponding path program 1 times [2025-03-16 19:27:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888968592] [2025-03-16 19:27:05,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:05,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:27:05,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:27:05,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:05,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888968592] [2025-03-16 19:27:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888968592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:05,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:05,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:27:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286117769] [2025-03-16 19:27:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:05,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:27:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:05,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:27:05,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:27:05,136 INFO L87 Difference]: Start difference. First operand 2916 states and 3941 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:06,265 INFO L93 Difference]: Finished difference Result 6143 states and 8390 transitions. [2025-03-16 19:27:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:27:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:27:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:06,277 INFO L225 Difference]: With dead ends: 6143 [2025-03-16 19:27:06,277 INFO L226 Difference]: Without dead ends: 4032 [2025-03-16 19:27:06,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:27:06,283 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 7612 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7612 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:06,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7612 Valid, 1433 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:27:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2025-03-16 19:27:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 4018. [2025-03-16 19:27:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4018 states, 4011 states have (on average 1.350536025928696) internal successors, (5417), 4017 states have internal predecessors, (5417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 4018 states and 5417 transitions. [2025-03-16 19:27:06,358 INFO L78 Accepts]: Start accepts. Automaton has 4018 states and 5417 transitions. Word has length 64 [2025-03-16 19:27:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:06,358 INFO L471 AbstractCegarLoop]: Abstraction has 4018 states and 5417 transitions. [2025-03-16 19:27:06,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4018 states and 5417 transitions. [2025-03-16 19:27:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:27:06,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:06,362 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-16 19:27:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:27:06,362 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-16 19:27:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1052192573, now seen corresponding path program 1 times [2025-03-16 19:27:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095385377] [2025-03-16 19:27:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:06,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:27:06,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:27:06,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:06,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:06,729 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-16 19:27:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:06,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095385377] [2025-03-16 19:27:06,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095385377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:06,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:06,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263653292] [2025-03-16 19:27:06,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:06,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:06,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:06,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:06,734 INFO L87 Difference]: Start difference. First operand 4018 states and 5417 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-16 19:27:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:08,543 INFO L93 Difference]: Finished difference Result 4766 states and 6472 transitions. [2025-03-16 19:27:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-16 19:27:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:08,556 INFO L225 Difference]: With dead ends: 4766 [2025-03-16 19:27:08,556 INFO L226 Difference]: Without dead ends: 4761 [2025-03-16 19:27:08,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:27:08,559 INFO L435 NwaCegarLoop]: 1087 mSDtfsCounter, 8106 mSDsluCounter, 3438 mSDsCounter, 0 mSdLazyCounter, 4481 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8106 SdHoareTripleChecker+Valid, 4525 SdHoareTripleChecker+Invalid, 4506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:08,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8106 Valid, 4525 Invalid, 4506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4481 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:27:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2025-03-16 19:27:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4018. [2025-03-16 19:27:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4018 states, 4011 states have (on average 1.350286711543256) internal successors, (5416), 4017 states have internal predecessors, (5416), 0 states have call successors, (0), 0 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-16 19:27:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 4018 states and 5416 transitions. [2025-03-16 19:27:08,629 INFO L78 Accepts]: Start accepts. Automaton has 4018 states and 5416 transitions. Word has length 65 [2025-03-16 19:27:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:08,630 INFO L471 AbstractCegarLoop]: Abstraction has 4018 states and 5416 transitions. [2025-03-16 19:27:08,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-16 19:27:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4018 states and 5416 transitions. [2025-03-16 19:27:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:27:08,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:08,634 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-16 19:27:08,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:27:08,634 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-16 19:27:08,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash 535151052, now seen corresponding path program 1 times [2025-03-16 19:27:08,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:08,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163432543] [2025-03-16 19:27:08,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:08,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:08,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:27:08,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:27:08,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:08,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:08,946 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-16 19:27:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163432543] [2025-03-16 19:27:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163432543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:08,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375968608] [2025-03-16 19:27:08,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:08,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:08,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:08,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:08,947 INFO L87 Difference]: Start difference. First operand 4018 states and 5416 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-16 19:27:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:10,999 INFO L93 Difference]: Finished difference Result 5794 states and 7977 transitions. [2025-03-16 19:27:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:11,000 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-16 19:27:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:11,010 INFO L225 Difference]: With dead ends: 5794 [2025-03-16 19:27:11,010 INFO L226 Difference]: Without dead ends: 4977 [2025-03-16 19:27:11,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:27:11,012 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 7668 mSDsluCounter, 4550 mSDsCounter, 0 mSdLazyCounter, 6079 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7668 SdHoareTripleChecker+Valid, 5603 SdHoareTripleChecker+Invalid, 6087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 6079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:11,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7668 Valid, 5603 Invalid, 6087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 6079 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 19:27:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4977 states. [2025-03-16 19:27:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4977 to 4025. [2025-03-16 19:27:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4025 states, 4018 states have (on average 1.349676455948233) internal successors, (5423), 4024 states have internal predecessors, (5423), 0 states have call successors, (0), 0 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-16 19:27:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4025 states to 4025 states and 5423 transitions. [2025-03-16 19:27:11,070 INFO L78 Accepts]: Start accepts. Automaton has 4025 states and 5423 transitions. Word has length 65 [2025-03-16 19:27:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:11,070 INFO L471 AbstractCegarLoop]: Abstraction has 4025 states and 5423 transitions. [2025-03-16 19:27:11,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-16 19:27:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4025 states and 5423 transitions. [2025-03-16 19:27:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:27:11,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:11,074 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-16 19:27:11,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:27:11,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1443687727, now seen corresponding path program 1 times [2025-03-16 19:27:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311975711] [2025-03-16 19:27:11,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:11,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:27:11,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:27:11,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:11,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:11,175 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-16 19:27:11,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:11,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311975711] [2025-03-16 19:27:11,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311975711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:11,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:11,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:27:11,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650426888] [2025-03-16 19:27:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:11,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:27:11,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:11,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:27:11,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:27:11,178 INFO L87 Difference]: Start difference. First operand 4025 states and 5423 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-16 19:27:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:11,994 INFO L93 Difference]: Finished difference Result 7925 states and 10749 transitions. [2025-03-16 19:27:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:27:11,994 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-16 19:27:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:12,008 INFO L225 Difference]: With dead ends: 7925 [2025-03-16 19:27:12,008 INFO L226 Difference]: Without dead ends: 5309 [2025-03-16 19:27:12,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:27:12,012 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 6558 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6558 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:12,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6558 Valid, 1244 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:27:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2025-03-16 19:27:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5299. [2025-03-16 19:27:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5292 states have (on average 1.3535525321239608) internal successors, (7163), 5298 states have internal predecessors, (7163), 0 states have call successors, (0), 0 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-16 19:27:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7163 transitions. [2025-03-16 19:27:12,089 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7163 transitions. Word has length 66 [2025-03-16 19:27:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:12,089 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7163 transitions. [2025-03-16 19:27:12,090 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-16 19:27:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7163 transitions. [2025-03-16 19:27:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:27:12,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:12,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:12,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:27:12,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:12,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1447226677, now seen corresponding path program 1 times [2025-03-16 19:27:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143004602] [2025-03-16 19:27:12,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:12,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:27:12,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:27:12,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:12,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:12,592 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-16 19:27:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143004602] [2025-03-16 19:27:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143004602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:12,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:12,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:27:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491137000] [2025-03-16 19:27:12,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:12,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:27:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:12,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:27:12,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:27:12,593 INFO L87 Difference]: Start difference. First operand 5299 states and 7163 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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-16 19:27:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:13,594 INFO L93 Difference]: Finished difference Result 8372 states and 11648 transitions. [2025-03-16 19:27:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:13,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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-16 19:27:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:13,614 INFO L225 Difference]: With dead ends: 8372 [2025-03-16 19:27:13,614 INFO L226 Difference]: Without dead ends: 8364 [2025-03-16 19:27:13,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:27:13,617 INFO L435 NwaCegarLoop]: 1760 mSDtfsCounter, 9491 mSDsluCounter, 8361 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9491 SdHoareTripleChecker+Valid, 10121 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:13,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9491 Valid, 10121 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2025-03-16 19:27:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 5291. [2025-03-16 19:27:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5285 states have (on average 1.3538315988647114) internal successors, (7155), 5290 states have internal predecessors, (7155), 0 states have call successors, (0), 0 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-16 19:27:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 7155 transitions. [2025-03-16 19:27:13,690 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 7155 transitions. Word has length 66 [2025-03-16 19:27:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:13,691 INFO L471 AbstractCegarLoop]: Abstraction has 5291 states and 7155 transitions. [2025-03-16 19:27:13,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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-16 19:27:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 7155 transitions. [2025-03-16 19:27:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:27:13,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:13,696 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-16 19:27:13,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:27:13,696 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-16 19:27:13,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash 446858259, now seen corresponding path program 1 times [2025-03-16 19:27:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:13,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39362860] [2025-03-16 19:27:13,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:13,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:27:13,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:27:13,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:13,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:13,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-16 19:27:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39362860] [2025-03-16 19:27:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39362860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:13,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:13,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035282888] [2025-03-16 19:27:13,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:13,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:13,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:13,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:13,749 INFO L87 Difference]: Start difference. First operand 5291 states and 7155 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:13,911 INFO L93 Difference]: Finished difference Result 10539 states and 14428 transitions. [2025-03-16 19:27:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:13,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:27:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:13,920 INFO L225 Difference]: With dead ends: 10539 [2025-03-16 19:27:13,920 INFO L226 Difference]: Without dead ends: 6426 [2025-03-16 19:27:13,924 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-16 19:27:13,925 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1651 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:13,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 2259 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6426 states. [2025-03-16 19:27:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6426 to 6416. [2025-03-16 19:27:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6416 states, 6410 states have (on average 1.3547581903276131) internal successors, (8684), 6415 states have internal predecessors, (8684), 0 states have call successors, (0), 0 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-16 19:27:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6416 states to 6416 states and 8684 transitions. [2025-03-16 19:27:14,020 INFO L78 Accepts]: Start accepts. Automaton has 6416 states and 8684 transitions. Word has length 66 [2025-03-16 19:27:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:14,021 INFO L471 AbstractCegarLoop]: Abstraction has 6416 states and 8684 transitions. [2025-03-16 19:27:14,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6416 states and 8684 transitions. [2025-03-16 19:27:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:27:14,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:14,024 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-16 19:27:14,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:27:14,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:14,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash 93668673, now seen corresponding path program 1 times [2025-03-16 19:27:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874946141] [2025-03-16 19:27:14,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:14,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:14,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:27:14,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:27:14,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:14,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:14,484 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-16 19:27:14,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:14,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874946141] [2025-03-16 19:27:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874946141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:14,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:27:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543440460] [2025-03-16 19:27:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:14,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:27:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:14,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:27:14,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:27:14,485 INFO L87 Difference]: Start difference. First operand 6416 states and 8684 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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-16 19:27:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:15,408 INFO L93 Difference]: Finished difference Result 11588 states and 16330 transitions. [2025-03-16 19:27:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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-16 19:27:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:15,423 INFO L225 Difference]: With dead ends: 11588 [2025-03-16 19:27:15,423 INFO L226 Difference]: Without dead ends: 9702 [2025-03-16 19:27:15,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:27:15,430 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 10424 mSDsluCounter, 8538 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10424 SdHoareTripleChecker+Valid, 10210 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:15,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10424 Valid, 10210 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2025-03-16 19:27:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 6348. [2025-03-16 19:27:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6348 states, 6343 states have (on average 1.3534605076462243) internal successors, (8585), 6347 states have internal predecessors, (8585), 0 states have call successors, (0), 0 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-16 19:27:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6348 states to 6348 states and 8585 transitions. [2025-03-16 19:27:15,562 INFO L78 Accepts]: Start accepts. Automaton has 6348 states and 8585 transitions. Word has length 66 [2025-03-16 19:27:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:15,562 INFO L471 AbstractCegarLoop]: Abstraction has 6348 states and 8585 transitions. [2025-03-16 19:27:15,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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-16 19:27:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6348 states and 8585 transitions. [2025-03-16 19:27:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:27:15,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:15,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:15,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:27:15,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:15,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1948095309, now seen corresponding path program 1 times [2025-03-16 19:27:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169218511] [2025-03-16 19:27:15,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:15,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:27:15,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:27:15,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:15,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:15,843 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-16 19:27:15,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:15,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169218511] [2025-03-16 19:27:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169218511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:15,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:15,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042052452] [2025-03-16 19:27:15,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:15,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:15,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:15,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:15,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:15,844 INFO L87 Difference]: Start difference. First operand 6348 states and 8585 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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-16 19:27:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:17,884 INFO L93 Difference]: Finished difference Result 10120 states and 14056 transitions. [2025-03-16 19:27:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:17,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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-16 19:27:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:17,894 INFO L225 Difference]: With dead ends: 10120 [2025-03-16 19:27:17,894 INFO L226 Difference]: Without dead ends: 8231 [2025-03-16 19:27:17,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:27:17,897 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 4985 mSDsluCounter, 4409 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4985 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 5143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:17,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4985 Valid, 5323 Invalid, 5143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 5116 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 19:27:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8231 states. [2025-03-16 19:27:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8231 to 6281. [2025-03-16 19:27:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6281 states, 6276 states have (on average 1.3526131293817718) internal successors, (8489), 6280 states have internal predecessors, (8489), 0 states have call successors, (0), 0 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-16 19:27:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8489 transitions. [2025-03-16 19:27:17,970 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8489 transitions. Word has length 67 [2025-03-16 19:27:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:17,970 INFO L471 AbstractCegarLoop]: Abstraction has 6281 states and 8489 transitions. [2025-03-16 19:27:17,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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-16 19:27:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8489 transitions. [2025-03-16 19:27:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:27:17,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:17,974 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-16 19:27:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:27:17,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1803297329, now seen corresponding path program 1 times [2025-03-16 19:27:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930245854] [2025-03-16 19:27:17,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:17,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:27:18,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:27:18,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:18,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:18,189 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-16 19:27:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930245854] [2025-03-16 19:27:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930245854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178464069] [2025-03-16 19:27:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:18,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:18,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:18,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:18,191 INFO L87 Difference]: Start difference. First operand 6281 states and 8489 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:20,002 INFO L93 Difference]: Finished difference Result 9825 states and 13512 transitions. [2025-03-16 19:27:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:27:20,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:27:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:20,014 INFO L225 Difference]: With dead ends: 9825 [2025-03-16 19:27:20,014 INFO L226 Difference]: Without dead ends: 9817 [2025-03-16 19:27:20,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:27:20,016 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 5382 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 4533 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5382 SdHoareTripleChecker+Valid, 4674 SdHoareTripleChecker+Invalid, 4564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:20,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5382 Valid, 4674 Invalid, 4564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4533 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:27:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9817 states. [2025-03-16 19:27:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9817 to 6281. [2025-03-16 19:27:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6281 states, 6276 states have (on average 1.3524537922243467) internal successors, (8488), 6280 states have internal predecessors, (8488), 0 states have call successors, (0), 0 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-16 19:27:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8488 transitions. [2025-03-16 19:27:20,092 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8488 transitions. Word has length 68 [2025-03-16 19:27:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:20,092 INFO L471 AbstractCegarLoop]: Abstraction has 6281 states and 8488 transitions. [2025-03-16 19:27:20,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8488 transitions. [2025-03-16 19:27:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:27:20,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:20,096 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-16 19:27:20,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:27:20,099 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:20,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1994482076, now seen corresponding path program 1 times [2025-03-16 19:27:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:20,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199720475] [2025-03-16 19:27:20,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:20,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:27:20,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:27:20,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:20,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:20,560 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-16 19:27:20,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199720475] [2025-03-16 19:27:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199720475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:20,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:20,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697108897] [2025-03-16 19:27:20,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:20,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:20,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:20,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:20,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:20,562 INFO L87 Difference]: Start difference. First operand 6281 states and 8488 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 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-16 19:27:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:21,850 INFO L93 Difference]: Finished difference Result 10779 states and 15152 transitions. [2025-03-16 19:27:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:27:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 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-16 19:27:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:21,860 INFO L225 Difference]: With dead ends: 10779 [2025-03-16 19:27:21,860 INFO L226 Difference]: Without dead ends: 8887 [2025-03-16 19:27:21,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:27:21,865 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 10261 mSDsluCounter, 8934 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10261 SdHoareTripleChecker+Valid, 10412 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:21,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10261 Valid, 10412 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:27:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-03-16 19:27:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 6207. [2025-03-16 19:27:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6207 states, 6203 states have (on average 1.3519264871836207) internal successors, (8386), 6206 states have internal predecessors, (8386), 0 states have call successors, (0), 0 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-16 19:27:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 8386 transitions. [2025-03-16 19:27:21,938 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 8386 transitions. Word has length 68 [2025-03-16 19:27:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 6207 states and 8386 transitions. [2025-03-16 19:27:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 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-16 19:27:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 8386 transitions. [2025-03-16 19:27:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:27:21,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:21,943 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-16 19:27:21,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:27:21,944 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:21,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash 270155419, now seen corresponding path program 1 times [2025-03-16 19:27:21,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:21,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612208368] [2025-03-16 19:27:21,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:21,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:27:21,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:27:21,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:21,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:22,106 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-16 19:27:22,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:22,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612208368] [2025-03-16 19:27:22,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612208368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:22,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:22,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964579727] [2025-03-16 19:27:22,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:22,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:22,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:22,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:22,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:22,108 INFO L87 Difference]: Start difference. First operand 6207 states and 8386 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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-16 19:27:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:23,416 INFO L93 Difference]: Finished difference Result 9578 states and 13380 transitions. [2025-03-16 19:27:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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-16 19:27:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:23,423 INFO L225 Difference]: With dead ends: 9578 [2025-03-16 19:27:23,423 INFO L226 Difference]: Without dead ends: 7752 [2025-03-16 19:27:23,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:27:23,425 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 4127 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 3453 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4127 SdHoareTripleChecker+Valid, 3634 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:23,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4127 Valid, 3634 Invalid, 3472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3453 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:27:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2025-03-16 19:27:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 6207. [2025-03-16 19:27:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6207 states, 6203 states have (on average 1.351604062550379) internal successors, (8384), 6206 states have internal predecessors, (8384), 0 states have call successors, (0), 0 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-16 19:27:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 8384 transitions. [2025-03-16 19:27:23,525 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 8384 transitions. Word has length 69 [2025-03-16 19:27:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:23,526 INFO L471 AbstractCegarLoop]: Abstraction has 6207 states and 8384 transitions. [2025-03-16 19:27:23,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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-16 19:27:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 8384 transitions. [2025-03-16 19:27:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:27:23,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:23,531 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-16 19:27:23,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:27:23,531 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:23,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:23,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1554551620, now seen corresponding path program 1 times [2025-03-16 19:27:23,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:23,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619683153] [2025-03-16 19:27:23,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:23,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:23,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:27:23,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:27:23,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:23,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:23,922 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-16 19:27:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619683153] [2025-03-16 19:27:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619683153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:27:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850787175] [2025-03-16 19:27:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:23,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:27:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:23,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:27:23,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:27:23,924 INFO L87 Difference]: Start difference. First operand 6207 states and 8384 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:24,965 INFO L93 Difference]: Finished difference Result 10786 states and 15160 transitions. [2025-03-16 19:27:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:27:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:27:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:24,975 INFO L225 Difference]: With dead ends: 10786 [2025-03-16 19:27:24,975 INFO L226 Difference]: Without dead ends: 8855 [2025-03-16 19:27:24,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:27:24,980 INFO L435 NwaCegarLoop]: 1457 mSDtfsCounter, 14290 mSDsluCounter, 7480 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14290 SdHoareTripleChecker+Valid, 8937 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:24,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14290 Valid, 8937 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8855 states. [2025-03-16 19:27:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8855 to 6175. [2025-03-16 19:27:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 6171 states have (on average 1.352292983309026) internal successors, (8345), 6174 states have internal predecessors, (8345), 0 states have call successors, (0), 0 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-16 19:27:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 8345 transitions. [2025-03-16 19:27:25,078 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 8345 transitions. Word has length 69 [2025-03-16 19:27:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:25,078 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 8345 transitions. [2025-03-16 19:27:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 8345 transitions. [2025-03-16 19:27:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:27:25,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:25,083 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-16 19:27:25,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:27:25,083 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:25,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash 310607661, now seen corresponding path program 1 times [2025-03-16 19:27:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620727013] [2025-03-16 19:27:25,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:25,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:27:25,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:27:25,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:25,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:25,127 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-16 19:27:25,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620727013] [2025-03-16 19:27:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620727013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:25,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162109649] [2025-03-16 19:27:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:25,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:25,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:25,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:25,128 INFO L87 Difference]: Start difference. First operand 6175 states and 8345 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:25,221 INFO L93 Difference]: Finished difference Result 9876 states and 13779 transitions. [2025-03-16 19:27:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:25,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:27:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:25,227 INFO L225 Difference]: With dead ends: 9876 [2025-03-16 19:27:25,227 INFO L226 Difference]: Without dead ends: 5858 [2025-03-16 19:27:25,232 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-16 19:27:25,232 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 1157 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:25,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1656 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2025-03-16 19:27:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 5854. [2025-03-16 19:27:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5854 states, 5852 states have (on average 1.3848257006151743) internal successors, (8104), 5853 states have internal predecessors, (8104), 0 states have call successors, (0), 0 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-16 19:27:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5854 states to 5854 states and 8104 transitions. [2025-03-16 19:27:25,291 INFO L78 Accepts]: Start accepts. Automaton has 5854 states and 8104 transitions. Word has length 69 [2025-03-16 19:27:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:25,291 INFO L471 AbstractCegarLoop]: Abstraction has 5854 states and 8104 transitions. [2025-03-16 19:27:25,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5854 states and 8104 transitions. [2025-03-16 19:27:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:27:25,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:25,296 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-16 19:27:25,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:27:25,296 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-16 19:27:25,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 865818298, now seen corresponding path program 1 times [2025-03-16 19:27:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413100705] [2025-03-16 19:27:25,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:25,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:27:25,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:27:25,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:25,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:25,575 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-16 19:27:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:25,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413100705] [2025-03-16 19:27:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413100705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:25,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:25,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491757395] [2025-03-16 19:27:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:25,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:25,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:25,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:25,578 INFO L87 Difference]: Start difference. First operand 5854 states and 8104 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 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-16 19:27:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:27,472 INFO L93 Difference]: Finished difference Result 11144 states and 15803 transitions. [2025-03-16 19:27:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:27:27,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 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-16 19:27:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:27,478 INFO L225 Difference]: With dead ends: 11144 [2025-03-16 19:27:27,478 INFO L226 Difference]: Without dead ends: 8146 [2025-03-16 19:27:27,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:27:27,482 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 4801 mSDsluCounter, 4467 mSDsCounter, 0 mSdLazyCounter, 4888 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4801 SdHoareTripleChecker+Valid, 5113 SdHoareTripleChecker+Invalid, 4941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:27,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4801 Valid, 5113 Invalid, 4941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4888 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:27:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8146 states. [2025-03-16 19:27:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8146 to 5854. [2025-03-16 19:27:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5854 states, 5852 states have (on average 1.384483937115516) internal successors, (8102), 5853 states have internal predecessors, (8102), 0 states have call successors, (0), 0 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-16 19:27:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5854 states to 5854 states and 8102 transitions. [2025-03-16 19:27:27,535 INFO L78 Accepts]: Start accepts. Automaton has 5854 states and 8102 transitions. Word has length 70 [2025-03-16 19:27:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:27,535 INFO L471 AbstractCegarLoop]: Abstraction has 5854 states and 8102 transitions. [2025-03-16 19:27:27,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 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-16 19:27:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5854 states and 8102 transitions. [2025-03-16 19:27:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:27:27,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:27,539 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-16 19:27:27,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:27:27,539 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-16 19:27:27,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -658354165, now seen corresponding path program 1 times [2025-03-16 19:27:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:27,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416626860] [2025-03-16 19:27:27,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:27,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:27:27,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:27:27,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:27,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:27,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:27,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416626860] [2025-03-16 19:27:27,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416626860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:27,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:27,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:27,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361529049] [2025-03-16 19:27:27,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:27,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:27,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:27,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:27,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:27,734 INFO L87 Difference]: Start difference. First operand 5854 states and 8102 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:28,968 INFO L93 Difference]: Finished difference Result 9030 states and 12832 transitions. [2025-03-16 19:27:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:27:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:28,974 INFO L225 Difference]: With dead ends: 9030 [2025-03-16 19:27:28,974 INFO L226 Difference]: Without dead ends: 5942 [2025-03-16 19:27:28,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:27:28,978 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 4212 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4212 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 3170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:28,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4212 Valid, 3388 Invalid, 3170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:27:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2025-03-16 19:27:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 5854. [2025-03-16 19:27:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5854 states, 5852 states have (on average 1.384313055365687) internal successors, (8101), 5853 states have internal predecessors, (8101), 0 states have call successors, (0), 0 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-16 19:27:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5854 states to 5854 states and 8101 transitions. [2025-03-16 19:27:29,030 INFO L78 Accepts]: Start accepts. Automaton has 5854 states and 8101 transitions. Word has length 70 [2025-03-16 19:27:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:29,030 INFO L471 AbstractCegarLoop]: Abstraction has 5854 states and 8101 transitions. [2025-03-16 19:27:29,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5854 states and 8101 transitions. [2025-03-16 19:27:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:27:29,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:29,034 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-16 19:27:29,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:27:29,035 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:29,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash -550919344, now seen corresponding path program 1 times [2025-03-16 19:27:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996376979] [2025-03-16 19:27:29,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:29,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:27:29,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:27:29,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:29,232 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-16 19:27:29,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:29,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996376979] [2025-03-16 19:27:29,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996376979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:29,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509455867] [2025-03-16 19:27:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:29,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:29,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:29,234 INFO L87 Difference]: Start difference. First operand 5854 states and 8101 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:30,438 INFO L93 Difference]: Finished difference Result 10782 states and 15372 transitions. [2025-03-16 19:27:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:30,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:27:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:30,447 INFO L225 Difference]: With dead ends: 10782 [2025-03-16 19:27:30,447 INFO L226 Difference]: Without dead ends: 8020 [2025-03-16 19:27:30,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:27:30,451 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 4329 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 3346 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4329 SdHoareTripleChecker+Valid, 3752 SdHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:30,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4329 Valid, 3752 Invalid, 3364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3346 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:27:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8020 states. [2025-03-16 19:27:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8020 to 5854. [2025-03-16 19:27:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5854 states, 5852 states have (on average 1.384142173615858) internal successors, (8100), 5853 states have internal predecessors, (8100), 0 states have call successors, (0), 0 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-16 19:27:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5854 states to 5854 states and 8100 transitions. [2025-03-16 19:27:30,503 INFO L78 Accepts]: Start accepts. Automaton has 5854 states and 8100 transitions. Word has length 70 [2025-03-16 19:27:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:30,503 INFO L471 AbstractCegarLoop]: Abstraction has 5854 states and 8100 transitions. [2025-03-16 19:27:30,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5854 states and 8100 transitions. [2025-03-16 19:27:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:27:30,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:30,507 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-16 19:27:30,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:27:30,507 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:30,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash -484721648, now seen corresponding path program 1 times [2025-03-16 19:27:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200274795] [2025-03-16 19:27:30,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:30,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:27:30,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:27:30,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:30,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200274795] [2025-03-16 19:27:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200274795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:30,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:30,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:30,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770699581] [2025-03-16 19:27:30,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:30,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:30,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:30,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:30,551 INFO L87 Difference]: Start difference. First operand 5854 states and 8100 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:30,611 INFO L93 Difference]: Finished difference Result 10028 states and 14557 transitions. [2025-03-16 19:27:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:27:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:30,618 INFO L225 Difference]: With dead ends: 10028 [2025-03-16 19:27:30,618 INFO L226 Difference]: Without dead ends: 6999 [2025-03-16 19:27:30,622 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-16 19:27:30,622 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 704 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:30,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1852 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:30,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6999 states. [2025-03-16 19:27:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6999 to 5755. [2025-03-16 19:27:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5755 states, 5753 states have (on average 1.4138710238136625) internal successors, (8134), 5754 states have internal predecessors, (8134), 0 states have call successors, (0), 0 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-16 19:27:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5755 states to 5755 states and 8134 transitions. [2025-03-16 19:27:30,678 INFO L78 Accepts]: Start accepts. Automaton has 5755 states and 8134 transitions. Word has length 70 [2025-03-16 19:27:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:30,679 INFO L471 AbstractCegarLoop]: Abstraction has 5755 states and 8134 transitions. [2025-03-16 19:27:30,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5755 states and 8134 transitions. [2025-03-16 19:27:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:27:30,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:30,683 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-16 19:27:30,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:27:30,683 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:30,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:30,683 INFO L85 PathProgramCache]: Analyzing trace with hash -875094767, now seen corresponding path program 1 times [2025-03-16 19:27:30,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:30,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518546732] [2025-03-16 19:27:30,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:30,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:30,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:27:30,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:27:30,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:30,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:30,727 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-16 19:27:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518546732] [2025-03-16 19:27:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518546732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:30,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:30,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575992778] [2025-03-16 19:27:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:30,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:30,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:30,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:30,728 INFO L87 Difference]: Start difference. First operand 5755 states and 8134 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-16 19:27:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:30,797 INFO L93 Difference]: Finished difference Result 12211 states and 17990 transitions. [2025-03-16 19:27:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:30,798 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-16 19:27:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:30,805 INFO L225 Difference]: With dead ends: 12211 [2025-03-16 19:27:30,806 INFO L226 Difference]: Without dead ends: 8307 [2025-03-16 19:27:30,810 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-16 19:27:30,811 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 724 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:30,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1780 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8307 states. [2025-03-16 19:27:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8307 to 8305. [2025-03-16 19:27:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8305 states, 8303 states have (on average 1.4441768035649765) internal successors, (11991), 8304 states have internal predecessors, (11991), 0 states have call successors, (0), 0 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-16 19:27:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8305 states to 8305 states and 11991 transitions. [2025-03-16 19:27:30,925 INFO L78 Accepts]: Start accepts. Automaton has 8305 states and 11991 transitions. Word has length 71 [2025-03-16 19:27:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:30,925 INFO L471 AbstractCegarLoop]: Abstraction has 8305 states and 11991 transitions. [2025-03-16 19:27:30,925 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-16 19:27:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8305 states and 11991 transitions. [2025-03-16 19:27:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:27:30,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:30,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] [2025-03-16 19:27:30,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:27:30,929 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-16 19:27:30,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash -628713762, now seen corresponding path program 1 times [2025-03-16 19:27:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957626186] [2025-03-16 19:27:30,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:30,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:27:30,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:27:30,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:30,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:30,985 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-16 19:27:30,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:30,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957626186] [2025-03-16 19:27:30,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957626186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:30,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:30,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:30,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910227096] [2025-03-16 19:27:30,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:30,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:30,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:30,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:30,987 INFO L87 Difference]: Start difference. First operand 8305 states and 11991 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-16 19:27:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:31,086 INFO L93 Difference]: Finished difference Result 20889 states and 30751 transitions. [2025-03-16 19:27:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:31,087 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-16 19:27:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:31,104 INFO L225 Difference]: With dead ends: 20889 [2025-03-16 19:27:31,104 INFO L226 Difference]: Without dead ends: 14167 [2025-03-16 19:27:31,114 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-16 19:27:31,115 INFO L435 NwaCegarLoop]: 1339 mSDtfsCounter, 732 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:31,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2253 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14167 states. [2025-03-16 19:27:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 14165. [2025-03-16 19:27:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14165 states, 14163 states have (on average 1.4439737343783097) internal successors, (20451), 14164 states have internal predecessors, (20451), 0 states have call successors, (0), 0 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-16 19:27:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14165 states to 14165 states and 20451 transitions. [2025-03-16 19:27:31,304 INFO L78 Accepts]: Start accepts. Automaton has 14165 states and 20451 transitions. Word has length 71 [2025-03-16 19:27:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:31,305 INFO L471 AbstractCegarLoop]: Abstraction has 14165 states and 20451 transitions. [2025-03-16 19:27:31,305 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-16 19:27:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14165 states and 20451 transitions. [2025-03-16 19:27:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:27:31,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:31,309 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-16 19:27:31,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:27:31,309 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:31,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:31,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1720227584, now seen corresponding path program 1 times [2025-03-16 19:27:31,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:31,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705592504] [2025-03-16 19:27:31,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:31,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:27:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:27:31,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:31,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:31,451 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-16 19:27:31,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705592504] [2025-03-16 19:27:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705592504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:31,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:31,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255896423] [2025-03-16 19:27:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:31,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:31,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:31,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:31,453 INFO L87 Difference]: Start difference. First operand 14165 states and 20451 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 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-16 19:27:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:32,529 INFO L93 Difference]: Finished difference Result 24734 states and 35649 transitions. [2025-03-16 19:27:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:27:32,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 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-16 19:27:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:32,556 INFO L225 Difference]: With dead ends: 24734 [2025-03-16 19:27:32,556 INFO L226 Difference]: Without dead ends: 24519 [2025-03-16 19:27:32,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:27:32,565 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 2694 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2694 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:32,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2694 Valid, 3253 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:27:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24519 states. [2025-03-16 19:27:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24519 to 14165. [2025-03-16 19:27:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14165 states, 14163 states have (on average 1.4439031278683894) internal successors, (20450), 14164 states have internal predecessors, (20450), 0 states have call successors, (0), 0 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-16 19:27:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14165 states to 14165 states and 20450 transitions. [2025-03-16 19:27:32,795 INFO L78 Accepts]: Start accepts. Automaton has 14165 states and 20450 transitions. Word has length 72 [2025-03-16 19:27:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:32,796 INFO L471 AbstractCegarLoop]: Abstraction has 14165 states and 20450 transitions. [2025-03-16 19:27:32,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 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-16 19:27:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 14165 states and 20450 transitions. [2025-03-16 19:27:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:27:32,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:32,799 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-16 19:27:32,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:27:32,799 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-16 19:27:32,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1671297480, now seen corresponding path program 1 times [2025-03-16 19:27:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:32,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736202146] [2025-03-16 19:27:32,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:32,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:27:32,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:27:32,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:32,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:32,837 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-16 19:27:32,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:32,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736202146] [2025-03-16 19:27:32,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736202146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:32,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:32,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092448802] [2025-03-16 19:27:32,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:32,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:32,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:32,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:32,838 INFO L87 Difference]: Start difference. First operand 14165 states and 20450 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:32,929 INFO L93 Difference]: Finished difference Result 29534 states and 43200 transitions. [2025-03-16 19:27:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:27:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:32,946 INFO L225 Difference]: With dead ends: 29534 [2025-03-16 19:27:32,947 INFO L226 Difference]: Without dead ends: 16251 [2025-03-16 19:27:32,960 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-16 19:27:32,960 INFO L435 NwaCegarLoop]: 1168 mSDtfsCounter, 1070 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:32,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 1531 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16251 states. [2025-03-16 19:27:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16251 to 13030. [2025-03-16 19:27:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13030 states, 13028 states have (on average 1.460700030703101) internal successors, (19030), 13029 states have internal predecessors, (19030), 0 states have call successors, (0), 0 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-16 19:27:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 19030 transitions. [2025-03-16 19:27:33,097 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 19030 transitions. Word has length 72 [2025-03-16 19:27:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:33,097 INFO L471 AbstractCegarLoop]: Abstraction has 13030 states and 19030 transitions. [2025-03-16 19:27:33,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 19030 transitions. [2025-03-16 19:27:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:27:33,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:33,099 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-16 19:27:33,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:27:33,099 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-16 19:27:33,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1884452555, now seen corresponding path program 1 times [2025-03-16 19:27:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:33,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332310843] [2025-03-16 19:27:33,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:33,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:27:33,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:27:33,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:33,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:33,233 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-16 19:27:33,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:33,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332310843] [2025-03-16 19:27:33,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332310843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:33,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:33,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303743656] [2025-03-16 19:27:33,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:33,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:33,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:33,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:33,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:33,235 INFO L87 Difference]: Start difference. First operand 13030 states and 19030 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:34,124 INFO L93 Difference]: Finished difference Result 16763 states and 24300 transitions. [2025-03-16 19:27:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:34,140 INFO L225 Difference]: With dead ends: 16763 [2025-03-16 19:27:34,140 INFO L226 Difference]: Without dead ends: 16552 [2025-03-16 19:27:34,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:27:34,146 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 4022 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4022 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:34,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4022 Valid, 2592 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16552 states. [2025-03-16 19:27:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16552 to 13030. [2025-03-16 19:27:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13030 states, 13028 states have (on average 1.460623272950568) internal successors, (19029), 13029 states have internal predecessors, (19029), 0 states have call successors, (0), 0 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-16 19:27:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 19029 transitions. [2025-03-16 19:27:34,332 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 19029 transitions. Word has length 73 [2025-03-16 19:27:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:34,332 INFO L471 AbstractCegarLoop]: Abstraction has 13030 states and 19029 transitions. [2025-03-16 19:27:34,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 19029 transitions. [2025-03-16 19:27:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:27:34,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:34,334 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-16 19:27:34,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:27:34,334 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-16 19:27:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash 702975278, now seen corresponding path program 1 times [2025-03-16 19:27:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101642219] [2025-03-16 19:27:34,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:34,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:27:34,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:27:34,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:34,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:34,467 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-16 19:27:34,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101642219] [2025-03-16 19:27:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101642219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:34,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:34,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043099158] [2025-03-16 19:27:34,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:34,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:34,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:34,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:34,469 INFO L87 Difference]: Start difference. First operand 13030 states and 19029 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:35,303 INFO L93 Difference]: Finished difference Result 13684 states and 19767 transitions. [2025-03-16 19:27:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:35,315 INFO L225 Difference]: With dead ends: 13684 [2025-03-16 19:27:35,315 INFO L226 Difference]: Without dead ends: 13483 [2025-03-16 19:27:35,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:27:35,320 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 4286 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4286 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:35,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4286 Valid, 2533 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13483 states. [2025-03-16 19:27:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13483 to 13030. [2025-03-16 19:27:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13030 states, 13028 states have (on average 1.460546515198035) internal successors, (19028), 13029 states have internal predecessors, (19028), 0 states have call successors, (0), 0 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-16 19:27:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 19028 transitions. [2025-03-16 19:27:35,449 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 19028 transitions. Word has length 73 [2025-03-16 19:27:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:35,449 INFO L471 AbstractCegarLoop]: Abstraction has 13030 states and 19028 transitions. [2025-03-16 19:27:35,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 19028 transitions. [2025-03-16 19:27:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:27:35,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:35,452 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-16 19:27:35,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:27:35,452 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-16 19:27:35,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash -385768919, now seen corresponding path program 1 times [2025-03-16 19:27:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:35,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241652498] [2025-03-16 19:27:35,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:35,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:27:35,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:27:35,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:35,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:35,497 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-16 19:27:35,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:35,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241652498] [2025-03-16 19:27:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241652498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:35,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776690679] [2025-03-16 19:27:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:35,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:35,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:35,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:35,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:35,499 INFO L87 Difference]: Start difference. First operand 13030 states and 19028 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-16 19:27:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:35,576 INFO L93 Difference]: Finished difference Result 30574 states and 45321 transitions. [2025-03-16 19:27:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:35,577 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-16 19:27:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:35,596 INFO L225 Difference]: With dead ends: 30574 [2025-03-16 19:27:35,596 INFO L226 Difference]: Without dead ends: 18918 [2025-03-16 19:27:35,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:35,608 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 669 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:35,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1654 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18918 states. [2025-03-16 19:27:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18918 to 15127. [2025-03-16 19:27:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15127 states, 15125 states have (on average 1.456198347107438) internal successors, (22025), 15126 states have internal predecessors, (22025), 0 states have call successors, (0), 0 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-16 19:27:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15127 states to 15127 states and 22025 transitions. [2025-03-16 19:27:35,838 INFO L78 Accepts]: Start accepts. Automaton has 15127 states and 22025 transitions. Word has length 73 [2025-03-16 19:27:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:35,838 INFO L471 AbstractCegarLoop]: Abstraction has 15127 states and 22025 transitions. [2025-03-16 19:27:35,838 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-16 19:27:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 15127 states and 22025 transitions. [2025-03-16 19:27:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:27:35,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:35,840 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-16 19:27:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:27:35,840 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-16 19:27:35,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1707849908, now seen corresponding path program 1 times [2025-03-16 19:27:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270635560] [2025-03-16 19:27:35,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:35,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:27:35,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:27:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:35,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:35,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270635560] [2025-03-16 19:27:35,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270635560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:35,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:35,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:35,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327815150] [2025-03-16 19:27:35,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:35,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:35,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:35,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:35,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:35,971 INFO L87 Difference]: Start difference. First operand 15127 states and 22025 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:36,827 INFO L93 Difference]: Finished difference Result 19369 states and 27987 transitions. [2025-03-16 19:27:36,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:36,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:36,848 INFO L225 Difference]: With dead ends: 19369 [2025-03-16 19:27:36,848 INFO L226 Difference]: Without dead ends: 19300 [2025-03-16 19:27:36,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:27:36,855 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 2767 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2767 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:36,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2767 Valid, 2477 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19300 states. [2025-03-16 19:27:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19300 to 15122. [2025-03-16 19:27:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15122 states, 15120 states have (on average 1.456084656084656) internal successors, (22016), 15121 states have internal predecessors, (22016), 0 states have call successors, (0), 0 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-16 19:27:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 22016 transitions. [2025-03-16 19:27:37,019 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 22016 transitions. Word has length 73 [2025-03-16 19:27:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:37,019 INFO L471 AbstractCegarLoop]: Abstraction has 15122 states and 22016 transitions. [2025-03-16 19:27:37,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 22016 transitions. [2025-03-16 19:27:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:27:37,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:37,021 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-16 19:27:37,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:27:37,021 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-16 19:27:37,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:37,022 INFO L85 PathProgramCache]: Analyzing trace with hash -640418577, now seen corresponding path program 1 times [2025-03-16 19:27:37,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:37,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238144047] [2025-03-16 19:27:37,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:37,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:37,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:27:37,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:27:37,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:37,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238144047] [2025-03-16 19:27:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238144047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:37,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313066905] [2025-03-16 19:27:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:37,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:37,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:37,176 INFO L87 Difference]: Start difference. First operand 15122 states and 22016 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:38,334 INFO L93 Difference]: Finished difference Result 22607 states and 32783 transitions. [2025-03-16 19:27:38,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:27:38,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:38,359 INFO L225 Difference]: With dead ends: 22607 [2025-03-16 19:27:38,359 INFO L226 Difference]: Without dead ends: 22531 [2025-03-16 19:27:38,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:27:38,368 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 3395 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3395 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:38,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3395 Valid, 2956 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2748 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:27:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22531 states. [2025-03-16 19:27:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22531 to 15122. [2025-03-16 19:27:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15122 states, 15120 states have (on average 1.4560185185185186) internal successors, (22015), 15121 states have internal predecessors, (22015), 0 states have call successors, (0), 0 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-16 19:27:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 22015 transitions. [2025-03-16 19:27:38,598 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 22015 transitions. Word has length 73 [2025-03-16 19:27:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:38,598 INFO L471 AbstractCegarLoop]: Abstraction has 15122 states and 22015 transitions. [2025-03-16 19:27:38,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 22015 transitions. [2025-03-16 19:27:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:27:38,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:38,600 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-16 19:27:38,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:27:38,600 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-16 19:27:38,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1671878082, now seen corresponding path program 1 times [2025-03-16 19:27:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:38,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292978792] [2025-03-16 19:27:38,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:38,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:27:38,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:27:38,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:38,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:38,783 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-16 19:27:38,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:38,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292978792] [2025-03-16 19:27:38,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292978792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:38,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:38,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750423273] [2025-03-16 19:27:38,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:38,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:38,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:38,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:38,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:38,785 INFO L87 Difference]: Start difference. First operand 15122 states and 22015 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:39,661 INFO L93 Difference]: Finished difference Result 19366 states and 27979 transitions. [2025-03-16 19:27:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:39,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:39,679 INFO L225 Difference]: With dead ends: 19366 [2025-03-16 19:27:39,679 INFO L226 Difference]: Without dead ends: 19300 [2025-03-16 19:27:39,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:27:39,684 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 4199 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4199 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:39,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4199 Valid, 2517 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19300 states. [2025-03-16 19:27:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19300 to 15122. [2025-03-16 19:27:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15122 states, 15120 states have (on average 1.4559523809523809) internal successors, (22014), 15121 states have internal predecessors, (22014), 0 states have call successors, (0), 0 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-16 19:27:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 22014 transitions. [2025-03-16 19:27:39,842 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 22014 transitions. Word has length 73 [2025-03-16 19:27:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:39,842 INFO L471 AbstractCegarLoop]: Abstraction has 15122 states and 22014 transitions. [2025-03-16 19:27:39,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-16 19:27:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 22014 transitions. [2025-03-16 19:27:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:27:39,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:39,844 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-16 19:27:39,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:27:39,844 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-16 19:27:39,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1522377984, now seen corresponding path program 1 times [2025-03-16 19:27:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:39,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948779853] [2025-03-16 19:27:39,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:39,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:39,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:27:39,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:27:39,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:39,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:40,266 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-16 19:27:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948779853] [2025-03-16 19:27:40,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948779853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:40,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:40,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:27:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689495284] [2025-03-16 19:27:40,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:40,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:27:40,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:40,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:27:40,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:27:40,270 INFO L87 Difference]: Start difference. First operand 15122 states and 22014 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 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-16 19:27:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:41,327 INFO L93 Difference]: Finished difference Result 35029 states and 51027 transitions. [2025-03-16 19:27:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:27:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 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-16 19:27:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:41,362 INFO L225 Difference]: With dead ends: 35029 [2025-03-16 19:27:41,362 INFO L226 Difference]: Without dead ends: 34937 [2025-03-16 19:27:41,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:27:41,374 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 5334 mSDsluCounter, 8814 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5334 SdHoareTripleChecker+Valid, 9977 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:41,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5334 Valid, 9977 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:27:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34937 states. [2025-03-16 19:27:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34937 to 15094. [2025-03-16 19:27:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15094 states, 15093 states have (on average 1.456039223481084) internal successors, (21976), 15093 states have internal predecessors, (21976), 0 states have call successors, (0), 0 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-16 19:27:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15094 states to 15094 states and 21976 transitions. [2025-03-16 19:27:41,581 INFO L78 Accepts]: Start accepts. Automaton has 15094 states and 21976 transitions. Word has length 75 [2025-03-16 19:27:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:41,581 INFO L471 AbstractCegarLoop]: Abstraction has 15094 states and 21976 transitions. [2025-03-16 19:27:41,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 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-16 19:27:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 15094 states and 21976 transitions. [2025-03-16 19:27:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:27:41,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:41,583 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-16 19:27:41,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:27:41,583 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-16 19:27:41,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:41,583 INFO L85 PathProgramCache]: Analyzing trace with hash -527924391, now seen corresponding path program 1 times [2025-03-16 19:27:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:41,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314531032] [2025-03-16 19:27:41,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:41,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:41,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:27:41,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:27:41,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:41,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:41,643 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-16 19:27:41,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:41,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314531032] [2025-03-16 19:27:41,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314531032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:41,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:41,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:41,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079133461] [2025-03-16 19:27:41,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:41,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:41,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:41,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:41,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:41,644 INFO L87 Difference]: Start difference. First operand 15094 states and 21976 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:41,849 INFO L93 Difference]: Finished difference Result 57927 states and 85060 transitions. [2025-03-16 19:27:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:41,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 19:27:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:41,894 INFO L225 Difference]: With dead ends: 57927 [2025-03-16 19:27:41,895 INFO L226 Difference]: Without dead ends: 43973 [2025-03-16 19:27:41,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:41,914 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 3766 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3766 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:41,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3766 Valid, 2405 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43973 states. [2025-03-16 19:27:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43973 to 28296. [2025-03-16 19:27:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28296 states, 28295 states have (on average 1.4482417388231137) internal successors, (40978), 28295 states have internal predecessors, (40978), 0 states have call successors, (0), 0 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-16 19:27:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28296 states to 28296 states and 40978 transitions. [2025-03-16 19:27:42,319 INFO L78 Accepts]: Start accepts. Automaton has 28296 states and 40978 transitions. Word has length 75 [2025-03-16 19:27:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:42,319 INFO L471 AbstractCegarLoop]: Abstraction has 28296 states and 40978 transitions. [2025-03-16 19:27:42,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 28296 states and 40978 transitions. [2025-03-16 19:27:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:42,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:42,321 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-16 19:27:42,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:27:42,322 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-16 19:27:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1225466942, now seen corresponding path program 1 times [2025-03-16 19:27:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276517949] [2025-03-16 19:27:42,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:42,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:42,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:42,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:42,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:42,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:42,667 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-16 19:27:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:42,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276517949] [2025-03-16 19:27:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276517949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471291282] [2025-03-16 19:27:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:42,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:42,668 INFO L87 Difference]: Start difference. First operand 28296 states and 40978 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 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-16 19:27:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:43,565 INFO L93 Difference]: Finished difference Result 62106 states and 89674 transitions. [2025-03-16 19:27:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:27:43,565 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 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-16 19:27:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:43,637 INFO L225 Difference]: With dead ends: 62106 [2025-03-16 19:27:43,637 INFO L226 Difference]: Without dead ends: 62009 [2025-03-16 19:27:43,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:27:43,659 INFO L435 NwaCegarLoop]: 994 mSDtfsCounter, 4744 mSDsluCounter, 5349 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 6343 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:43,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 6343 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:27:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62009 states. [2025-03-16 19:27:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62009 to 28263. [2025-03-16 19:27:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28263 states, 28262 states have (on average 1.4484466775175147) internal successors, (40936), 28262 states have internal predecessors, (40936), 0 states have call successors, (0), 0 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-16 19:27:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28263 states to 28263 states and 40936 transitions. [2025-03-16 19:27:44,147 INFO L78 Accepts]: Start accepts. Automaton has 28263 states and 40936 transitions. Word has length 76 [2025-03-16 19:27:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:44,148 INFO L471 AbstractCegarLoop]: Abstraction has 28263 states and 40936 transitions. [2025-03-16 19:27:44,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 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-16 19:27:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 28263 states and 40936 transitions. [2025-03-16 19:27:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:44,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:44,150 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-16 19:27:44,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:27:44,151 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-16 19:27:44,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:44,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1528003715, now seen corresponding path program 1 times [2025-03-16 19:27:44,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416306912] [2025-03-16 19:27:44,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:44,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:44,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:44,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:44,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:44,460 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-16 19:27:44,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:44,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416306912] [2025-03-16 19:27:44,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416306912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:44,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:44,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:27:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879774301] [2025-03-16 19:27:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:44,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:27:44,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:44,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:27:44,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:27:44,461 INFO L87 Difference]: Start difference. First operand 28263 states and 40936 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-16 19:27:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:45,046 INFO L93 Difference]: Finished difference Result 49013 states and 70933 transitions. [2025-03-16 19:27:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:27:45,046 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-16 19:27:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:45,099 INFO L225 Difference]: With dead ends: 49013 [2025-03-16 19:27:45,099 INFO L226 Difference]: Without dead ends: 48948 [2025-03-16 19:27:45,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:27:45,115 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 6071 mSDsluCounter, 3345 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6071 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:45,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6071 Valid, 4267 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:27:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48948 states. [2025-03-16 19:27:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48948 to 28262. [2025-03-16 19:27:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28262 states, 28261 states have (on average 1.4484271611054103) internal successors, (40934), 28261 states have internal predecessors, (40934), 0 states have call successors, (0), 0 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-16 19:27:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28262 states to 28262 states and 40934 transitions. [2025-03-16 19:27:45,551 INFO L78 Accepts]: Start accepts. Automaton has 28262 states and 40934 transitions. Word has length 76 [2025-03-16 19:27:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:45,552 INFO L471 AbstractCegarLoop]: Abstraction has 28262 states and 40934 transitions. [2025-03-16 19:27:45,552 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-16 19:27:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28262 states and 40934 transitions. [2025-03-16 19:27:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:45,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:45,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:45,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:27:45,554 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1058002233, now seen corresponding path program 1 times [2025-03-16 19:27:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:45,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443982159] [2025-03-16 19:27:45,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:45,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:45,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:45,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:45,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:45,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:46,599 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-16 19:27:46,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:46,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443982159] [2025-03-16 19:27:46,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443982159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:46,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:46,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-16 19:27:46,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047289434] [2025-03-16 19:27:46,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:46,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:27:46,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:46,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:27:46,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:27:46,600 INFO L87 Difference]: Start difference. First operand 28262 states and 40934 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 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-16 19:27:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:51,053 INFO L93 Difference]: Finished difference Result 51710 states and 74608 transitions. [2025-03-16 19:27:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 19:27:51,053 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 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-16 19:27:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:51,116 INFO L225 Difference]: With dead ends: 51710 [2025-03-16 19:27:51,117 INFO L226 Difference]: Without dead ends: 51645 [2025-03-16 19:27:51,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=376, Invalid=2174, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 19:27:51,136 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 8298 mSDsluCounter, 16527 mSDsCounter, 0 mSdLazyCounter, 6932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8298 SdHoareTripleChecker+Valid, 17469 SdHoareTripleChecker+Invalid, 6934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:51,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8298 Valid, 17469 Invalid, 6934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6932 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 19:27:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51645 states. [2025-03-16 19:27:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51645 to 28280. [2025-03-16 19:27:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28280 states, 28279 states have (on average 1.4483185402595566) internal successors, (40957), 28279 states have internal predecessors, (40957), 0 states have call successors, (0), 0 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-16 19:27:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28280 states to 28280 states and 40957 transitions. [2025-03-16 19:27:51,540 INFO L78 Accepts]: Start accepts. Automaton has 28280 states and 40957 transitions. Word has length 76 [2025-03-16 19:27:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:51,540 INFO L471 AbstractCegarLoop]: Abstraction has 28280 states and 40957 transitions. [2025-03-16 19:27:51,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 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-16 19:27:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 28280 states and 40957 transitions. [2025-03-16 19:27:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:51,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:51,542 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-16 19:27:51,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:27:51,543 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-16 19:27:51,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1363435225, now seen corresponding path program 1 times [2025-03-16 19:27:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:51,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102128738] [2025-03-16 19:27:51,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:51,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:51,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:51,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:51,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:52,034 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-16 19:27:52,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:52,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102128738] [2025-03-16 19:27:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102128738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:52,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:52,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:27:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968420119] [2025-03-16 19:27:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:52,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:27:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:52,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:27:52,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:27:52,036 INFO L87 Difference]: Start difference. First operand 28280 states and 40957 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:53,051 INFO L93 Difference]: Finished difference Result 66943 states and 96723 transitions. [2025-03-16 19:27:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:27:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:27:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:53,122 INFO L225 Difference]: With dead ends: 66943 [2025-03-16 19:27:53,122 INFO L226 Difference]: Without dead ends: 66842 [2025-03-16 19:27:53,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:27:53,142 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 7080 mSDsluCounter, 6566 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7080 SdHoareTripleChecker+Valid, 7578 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:53,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7080 Valid, 7578 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:27:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66842 states. [2025-03-16 19:27:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66842 to 28236. [2025-03-16 19:27:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28236 states, 28235 states have (on average 1.4485567557995396) internal successors, (40900), 28235 states have internal predecessors, (40900), 0 states have call successors, (0), 0 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-16 19:27:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28236 states to 28236 states and 40900 transitions. [2025-03-16 19:27:53,602 INFO L78 Accepts]: Start accepts. Automaton has 28236 states and 40900 transitions. Word has length 76 [2025-03-16 19:27:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:53,602 INFO L471 AbstractCegarLoop]: Abstraction has 28236 states and 40900 transitions. [2025-03-16 19:27:53,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28236 states and 40900 transitions. [2025-03-16 19:27:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:53,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:53,605 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-16 19:27:53,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:27:53,605 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-16 19:27:53,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash 802389308, now seen corresponding path program 1 times [2025-03-16 19:27:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147581967] [2025-03-16 19:27:53,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:53,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:53,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:53,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:53,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:53,682 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-16 19:27:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147581967] [2025-03-16 19:27:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147581967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098082413] [2025-03-16 19:27:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:53,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:53,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:53,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:53,683 INFO L87 Difference]: Start difference. First operand 28236 states and 40900 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:53,849 INFO L93 Difference]: Finished difference Result 47724 states and 69154 transitions. [2025-03-16 19:27:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:53,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:27:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:53,870 INFO L225 Difference]: With dead ends: 47724 [2025-03-16 19:27:53,870 INFO L226 Difference]: Without dead ends: 20529 [2025-03-16 19:27:53,889 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-16 19:27:53,889 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 1926 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1926 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:53,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1926 Valid, 1682 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20529 states. [2025-03-16 19:27:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20529 to 20523. [2025-03-16 19:27:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20523 states, 20522 states have (on average 1.434022025143748) internal successors, (29429), 20522 states have internal predecessors, (29429), 0 states have call successors, (0), 0 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-16 19:27:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20523 states to 20523 states and 29429 transitions. [2025-03-16 19:27:54,082 INFO L78 Accepts]: Start accepts. Automaton has 20523 states and 29429 transitions. Word has length 76 [2025-03-16 19:27:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:54,082 INFO L471 AbstractCegarLoop]: Abstraction has 20523 states and 29429 transitions. [2025-03-16 19:27:54,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20523 states and 29429 transitions. [2025-03-16 19:27:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:27:54,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:54,085 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-16 19:27:54,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:27:54,085 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-16 19:27:54,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1760041910, now seen corresponding path program 1 times [2025-03-16 19:27:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239343263] [2025-03-16 19:27:54,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:54,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:27:54,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:27:54,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:54,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:54,143 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-16 19:27:54,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239343263] [2025-03-16 19:27:54,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239343263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:54,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:54,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789666713] [2025-03-16 19:27:54,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:54,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:54,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:54,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:54,144 INFO L87 Difference]: Start difference. First operand 20523 states and 29429 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-16 19:27:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:54,281 INFO L93 Difference]: Finished difference Result 58033 states and 83575 transitions. [2025-03-16 19:27:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:54,282 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-16 19:27:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:54,321 INFO L225 Difference]: With dead ends: 58033 [2025-03-16 19:27:54,321 INFO L226 Difference]: Without dead ends: 38551 [2025-03-16 19:27:54,341 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-16 19:27:54,341 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 495 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1463 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38551 states. [2025-03-16 19:27:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38551 to 36597. [2025-03-16 19:27:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36597 states, 36596 states have (on average 1.431167340692972) internal successors, (52375), 36596 states have internal predecessors, (52375), 0 states have call successors, (0), 0 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-16 19:27:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36597 states to 36597 states and 52375 transitions. [2025-03-16 19:27:54,737 INFO L78 Accepts]: Start accepts. Automaton has 36597 states and 52375 transitions. Word has length 77 [2025-03-16 19:27:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:54,737 INFO L471 AbstractCegarLoop]: Abstraction has 36597 states and 52375 transitions. [2025-03-16 19:27:54,737 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-16 19:27:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36597 states and 52375 transitions. [2025-03-16 19:27:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:27:54,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:54,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:54,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:27:54,740 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-16 19:27:54,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:54,740 INFO L85 PathProgramCache]: Analyzing trace with hash -114484007, now seen corresponding path program 1 times [2025-03-16 19:27:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:54,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667669111] [2025-03-16 19:27:54,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:54,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:27:54,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:27:54,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:54,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:54,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:54,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667669111] [2025-03-16 19:27:54,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667669111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:54,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:54,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833162166] [2025-03-16 19:27:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:54,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:54,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:54,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:54,809 INFO L87 Difference]: Start difference. First operand 36597 states and 52375 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-16 19:27:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:55,057 INFO L93 Difference]: Finished difference Result 104801 states and 150057 transitions. [2025-03-16 19:27:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:55,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-16 19:27:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:55,136 INFO L225 Difference]: With dead ends: 104801 [2025-03-16 19:27:55,136 INFO L226 Difference]: Without dead ends: 69245 [2025-03-16 19:27:55,173 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-16 19:27:55,174 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 387 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:55,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1528 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69245 states. [2025-03-16 19:27:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69245 to 65339. [2025-03-16 19:27:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65339 states, 65338 states have (on average 1.422801432550736) internal successors, (92963), 65338 states have internal predecessors, (92963), 0 states have call successors, (0), 0 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-16 19:27:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65339 states to 65339 states and 92963 transitions. [2025-03-16 19:27:55,890 INFO L78 Accepts]: Start accepts. Automaton has 65339 states and 92963 transitions. Word has length 80 [2025-03-16 19:27:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:55,890 INFO L471 AbstractCegarLoop]: Abstraction has 65339 states and 92963 transitions. [2025-03-16 19:27:55,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-16 19:27:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 65339 states and 92963 transitions. [2025-03-16 19:27:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:27:55,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:55,892 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-16 19:27:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:27:55,892 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-16 19:27:55,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash 285968810, now seen corresponding path program 1 times [2025-03-16 19:27:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727059198] [2025-03-16 19:27:55,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:55,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:27:55,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:27:55,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:55,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:56,017 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-16 19:27:56,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727059198] [2025-03-16 19:27:56,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727059198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:56,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:56,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342286255] [2025-03-16 19:27:56,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:56,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:56,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:56,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:56,018 INFO L87 Difference]: Start difference. First operand 65339 states and 92963 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-16 19:27:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:56,265 INFO L93 Difference]: Finished difference Result 69541 states and 98564 transitions. [2025-03-16 19:27:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:56,265 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-16 19:27:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:56,342 INFO L225 Difference]: With dead ends: 69541 [2025-03-16 19:27:56,342 INFO L226 Difference]: Without dead ends: 69539 [2025-03-16 19:27:56,364 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-16 19:27:56,365 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 0 mSDsluCounter, 3742 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:56,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4680 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69539 states. [2025-03-16 19:27:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69539 to 69539. [2025-03-16 19:27:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69539 states, 69538 states have (on average 1.3972648048548995) internal successors, (97163), 69538 states have internal predecessors, (97163), 0 states have call successors, (0), 0 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-16 19:27:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69539 states to 69539 states and 97163 transitions. [2025-03-16 19:27:57,061 INFO L78 Accepts]: Start accepts. Automaton has 69539 states and 97163 transitions. Word has length 81 [2025-03-16 19:27:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:57,061 INFO L471 AbstractCegarLoop]: Abstraction has 69539 states and 97163 transitions. [2025-03-16 19:27:57,061 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-16 19:27:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 69539 states and 97163 transitions. [2025-03-16 19:27:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:27:57,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:57,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:57,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:27:57,063 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-16 19:27:57,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash 381485451, now seen corresponding path program 1 times [2025-03-16 19:27:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134366693] [2025-03-16 19:27:57,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:57,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:27:57,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:27:57,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:57,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:57,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-16 19:27:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134366693] [2025-03-16 19:27:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134366693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:57,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:57,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168976560] [2025-03-16 19:27:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:57,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:57,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:57,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:57,102 INFO L87 Difference]: Start difference. First operand 69539 states and 97163 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:57,437 INFO L93 Difference]: Finished difference Result 195151 states and 272757 transitions. [2025-03-16 19:27:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:57,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:27:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:57,584 INFO L225 Difference]: With dead ends: 195151 [2025-03-16 19:27:57,584 INFO L226 Difference]: Without dead ends: 126621 [2025-03-16 19:27:57,647 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-16 19:27:57,647 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 467 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:57,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1409 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:57,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126621 states. [2025-03-16 19:27:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126621 to 125219. [2025-03-16 19:27:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125219 states, 125218 states have (on average 1.3777412193135172) internal successors, (172518), 125218 states have internal predecessors, (172518), 0 states have call successors, (0), 0 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-16 19:27:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125219 states to 125219 states and 172518 transitions. [2025-03-16 19:27:59,484 INFO L78 Accepts]: Start accepts. Automaton has 125219 states and 172518 transitions. Word has length 82 [2025-03-16 19:27:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:59,484 INFO L471 AbstractCegarLoop]: Abstraction has 125219 states and 172518 transitions. [2025-03-16 19:27:59,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 125219 states and 172518 transitions. [2025-03-16 19:27:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:27:59,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:59,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:59,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:27:59,488 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-16 19:27:59,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1241016454, now seen corresponding path program 1 times [2025-03-16 19:27:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:59,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960262335] [2025-03-16 19:27:59,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:59,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:59,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:27:59,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:27:59,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:59,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:59,567 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-16 19:27:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960262335] [2025-03-16 19:27:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960262335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434782731] [2025-03-16 19:27:59,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:59,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:59,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:59,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:59,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:59,569 INFO L87 Difference]: Start difference. First operand 125219 states and 172518 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:00,617 INFO L93 Difference]: Finished difference Result 248214 states and 342596 transitions. [2025-03-16 19:28:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:28:00,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:28:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:00,911 INFO L225 Difference]: With dead ends: 248214 [2025-03-16 19:28:00,911 INFO L226 Difference]: Without dead ends: 210904 [2025-03-16 19:28:00,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:00,953 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 2901 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2901 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:00,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2901 Valid, 2353 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210904 states. [2025-03-16 19:28:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210904 to 158691. [2025-03-16 19:28:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158691 states, 158690 states have (on average 1.3744407335055768) internal successors, (218110), 158690 states have internal predecessors, (218110), 0 states have call successors, (0), 0 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-16 19:28:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158691 states to 158691 states and 218110 transitions. [2025-03-16 19:28:03,133 INFO L78 Accepts]: Start accepts. Automaton has 158691 states and 218110 transitions. Word has length 84 [2025-03-16 19:28:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 158691 states and 218110 transitions. [2025-03-16 19:28:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 158691 states and 218110 transitions. [2025-03-16 19:28:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:28:03,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:03,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:03,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:28:03,427 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-16 19:28:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -27151758, now seen corresponding path program 1 times [2025-03-16 19:28:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:03,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288517742] [2025-03-16 19:28:03,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:03,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:28:03,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:28:03,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:03,497 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-16 19:28:03,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:03,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288517742] [2025-03-16 19:28:03,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288517742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:03,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:03,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:03,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481780761] [2025-03-16 19:28:03,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:03,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:03,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:03,498 INFO L87 Difference]: Start difference. First operand 158691 states and 218110 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:03,863 INFO L93 Difference]: Finished difference Result 194407 states and 266440 transitions. [2025-03-16 19:28:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:03,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-16 19:28:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:04,259 INFO L225 Difference]: With dead ends: 194407 [2025-03-16 19:28:04,259 INFO L226 Difference]: Without dead ends: 122981 [2025-03-16 19:28:04,293 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-16 19:28:04,293 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 355 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:04,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1605 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122981 states. [2025-03-16 19:28:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122981 to 122235. [2025-03-16 19:28:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122235 states, 122234 states have (on average 1.3522096961565522) internal successors, (165286), 122234 states have internal predecessors, (165286), 0 states have call successors, (0), 0 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-16 19:28:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122235 states to 122235 states and 165286 transitions. [2025-03-16 19:28:05,934 INFO L78 Accepts]: Start accepts. Automaton has 122235 states and 165286 transitions. Word has length 87 [2025-03-16 19:28:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:05,934 INFO L471 AbstractCegarLoop]: Abstraction has 122235 states and 165286 transitions. [2025-03-16 19:28:05,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 122235 states and 165286 transitions. [2025-03-16 19:28:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:28:05,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:05,937 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-16 19:28:05,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:28:05,937 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-16 19:28:05,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1851696867, now seen corresponding path program 1 times [2025-03-16 19:28:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669780881] [2025-03-16 19:28:05,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:05,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:28:05,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:28:05,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:05,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:06,020 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-16 19:28:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:06,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669780881] [2025-03-16 19:28:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669780881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:06,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087840510] [2025-03-16 19:28:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:06,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:06,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:06,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:06,022 INFO L87 Difference]: Start difference. First operand 122235 states and 165286 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) 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-16 19:28:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:07,349 INFO L93 Difference]: Finished difference Result 281815 states and 383320 transitions. [2025-03-16 19:28:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:28:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) 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-16 19:28:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:07,673 INFO L225 Difference]: With dead ends: 281815 [2025-03-16 19:28:07,673 INFO L226 Difference]: Without dead ends: 224021 [2025-03-16 19:28:07,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:28:07,746 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 4150 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4150 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:07,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4150 Valid, 1153 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224021 states. [2025-03-16 19:28:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224021 to 142763. [2025-03-16 19:28:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142763 states, 142762 states have (on average 1.3430324596181056) internal successors, (191734), 142762 states have internal predecessors, (191734), 0 states have call successors, (0), 0 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-16 19:28:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142763 states to 142763 states and 191734 transitions. [2025-03-16 19:28:10,263 INFO L78 Accepts]: Start accepts. Automaton has 142763 states and 191734 transitions. Word has length 87 [2025-03-16 19:28:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:10,263 INFO L471 AbstractCegarLoop]: Abstraction has 142763 states and 191734 transitions. [2025-03-16 19:28:10,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) 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-16 19:28:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 142763 states and 191734 transitions. [2025-03-16 19:28:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:28:10,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:10,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:28:10,266 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-16 19:28:10,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 754727126, now seen corresponding path program 1 times [2025-03-16 19:28:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:10,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730604429] [2025-03-16 19:28:10,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:10,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:28:10,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:28:10,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:10,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:10,350 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-16 19:28:10,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:10,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730604429] [2025-03-16 19:28:10,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730604429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:10,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:10,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268091284] [2025-03-16 19:28:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:10,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:28:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:10,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:28:10,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:28:10,351 INFO L87 Difference]: Start difference. First operand 142763 states and 191734 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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-16 19:28:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:10,928 INFO L93 Difference]: Finished difference Result 238446 states and 321496 transitions. [2025-03-16 19:28:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:28:10,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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-16 19:28:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:11,194 INFO L225 Difference]: With dead ends: 238446 [2025-03-16 19:28:11,194 INFO L226 Difference]: Without dead ends: 204764 [2025-03-16 19:28:11,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:11,273 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 2827 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2827 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:11,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2827 Valid, 2384 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]