./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-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 b13c8169fb5357220d29959d63393b66877a012797fdaa495805bf5299de8fb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:24:06,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:24:06,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:24:06,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:24:06,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:24:06,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:24:06,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:24:06,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:24:06,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:24:06,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:24:06,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:24:06,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:24:06,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:24:06,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:24:06,520 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:24:06,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:24:06,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:24:06,520 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:24:06,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:24:06,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:24:06,521 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:24:06,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:24:06,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:24:06,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:24:06,523 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 -> b13c8169fb5357220d29959d63393b66877a012797fdaa495805bf5299de8fb1 [2025-03-16 19:24:06,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:24:06,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:24:06,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:24:06,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:24:06,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:24:06,767 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:24:07,953 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2ad14b3/766811e92e184a5f8e4a519a2d21167c/FLAG296e05c97 [2025-03-16 19:24:08,307 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:24:08,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:24:08,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2ad14b3/766811e92e184a5f8e4a519a2d21167c/FLAG296e05c97 [2025-03-16 19:24:08,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2ad14b3/766811e92e184a5f8e4a519a2d21167c [2025-03-16 19:24:08,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:24:08,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:24:08,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:24:08,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:24:08,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:24:08,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:08,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f326f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08, skipping insertion in model container [2025-03-16 19:24:08,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:08,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:24:08,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8622,8635] [2025-03-16 19:24:08,589 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15089,15102] [2025-03-16 19:24:08,595 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17286,17299] [2025-03-16 19:24:08,598 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18310,18323] [2025-03-16 19:24:08,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:24:08,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:24:08,741 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8622,8635] [2025-03-16 19:24:08,757 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15089,15102] [2025-03-16 19:24:08,761 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17286,17299] [2025-03-16 19:24:08,763 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18310,18323] [2025-03-16 19:24:08,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:24:08,844 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:24:08,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08 WrapperNode [2025-03-16 19:24:08,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:24:08,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:24:08,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:24:08,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:24:08,851 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:24:08" (1/1) ... [2025-03-16 19:24:08,870 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:24:08" (1/1) ... [2025-03-16 19:24:08,919 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2803 [2025-03-16 19:24:08,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:24:08,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:24:08,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:24:08,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:24:08,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:08,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:08,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:08,973 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:24:08,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:08,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:09,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:09,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:09,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:09,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:09,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:24:09,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:24:09,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:24:09,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:24:09,034 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (1/1) ... [2025-03-16 19:24:09,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:24:09,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:09,057 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:24:09,075 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:24:09,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:24:09,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:24:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:24:09,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:24:09,214 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:24:09,215 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:24:10,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2348: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-16 19:24:10,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: havoc main_~node2__m2~1#1; [2025-03-16 19:24:10,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2282: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-03-16 19:24:10,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4198: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1; [2025-03-16 19:24:10,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:24:10,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1160: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-16 19:24:10,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:24:10,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2683: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~30#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4005: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1;havoc main_~node3____CPAchecker_TMP_1~11#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2552: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~28#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L901: havoc main_~node3__m3~3#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2224: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3812: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1566: havoc main_~node3__m3~6#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3351: havoc main_~node3__m3~13#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4144: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3087: havoc main_~node3__m3~12#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2031: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3947: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2494: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-16 19:24:10,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:24:10,474 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2166: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-03-16 19:24:10,474 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2629: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~29#1; [2025-03-16 19:24:10,474 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L317: havoc main_~node3__m3~1#1; [2025-03-16 19:24:10,474 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:24:10,474 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3754: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1;havoc main_~node3____CPAchecker_TMP_1~10#1; [2025-03-16 19:24:10,474 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1576: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:24:10,474 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2436: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~26#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3361: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L851: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_~node2__m2~2#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L985: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: havoc main_~node3__m3~11#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:24:10,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3893: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1780: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3696: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3565: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3301: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2112: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059: havoc main_~node2__m2~3#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2382: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~25#1; [2025-03-16 19:24:10,476 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4100: havoc main_~node3__m3~16#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2846: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3507: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2319: havoc main_~node2__m2~4#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3642: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2585: havoc main_~node3__m3~10#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3__m3~2#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1; [2025-03-16 19:24:10,477 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-03-16 19:24:10,478 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-03-16 19:24:10,478 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L211: havoc main_~node2__m2~0#1; [2025-03-16 19:24:10,478 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1533: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-16 19:24:10,478 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3449: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-03-16 19:24:10,478 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3185: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1; [2025-03-16 19:24:10,478 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4110: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-03-16 19:24:10,478 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2329: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:24:10,479 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3849: havoc main_~node3__m3~15#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-16 19:24:10,479 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:24:10,479 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1273: havoc main_~check__tmp~9#1; [2025-03-16 19:24:10,479 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L943: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2595: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1076: havoc main_~node3__m3~4#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4314: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1209: havoc main_~node3__m3~5#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2068: havoc main_~node3__m3~8#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1475: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L684: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2799: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~32#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1610: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2338: havoc main_~node3__m3~9#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3395: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3131: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3859: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4256: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1;havoc main_~node3____CPAchecker_TMP_1~12#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3332: havoc main_~node2__m2~5#1; [2025-03-16 19:24:10,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1417: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-16 19:24:10,481 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2078: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:24:10,481 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3598: havoc main_~node3__m3~14#1; [2025-03-16 19:24:10,481 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L626: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:24:10,481 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: havoc main_~node3__m3~0#1; [2025-03-16 19:24:10,481 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-16 19:24:10,481 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4063: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-03-16 19:24:10,481 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1817: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:24:10,569 INFO L? ?]: Removed 482 outVars from TransFormulas that were not future-live. [2025-03-16 19:24:10,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:24:10,588 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:24:10,588 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:24:10,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:24:10 BoogieIcfgContainer [2025-03-16 19:24:10,588 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:24:10,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:24:10,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:24:10,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:24:10,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:24:08" (1/3) ... [2025-03-16 19:24:10,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23065e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:24:10, skipping insertion in model container [2025-03-16 19:24:10,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:08" (2/3) ... [2025-03-16 19:24:10,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23065e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:24:10, skipping insertion in model container [2025-03-16 19:24:10,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:24:10" (3/3) ... [2025-03-16 19:24:10,599 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:24:10,610 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:24:10,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 441 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-16 19:24:10,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:24:10,690 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;@1a7b94e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:24:10,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-16 19:24:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 441 states, 436 states have (on average 1.860091743119266) internal successors, (811), 440 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:24:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:24:10,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:10,704 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] [2025-03-16 19:24:10,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:10,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash -188299128, now seen corresponding path program 1 times [2025-03-16 19:24:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:10,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044816957] [2025-03-16 19:24:10,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:10,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:24:10,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:24:10,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:10,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:11,051 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:24:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044816957] [2025-03-16 19:24:11,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044816957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:11,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797264204] [2025-03-16 19:24:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:11,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:11,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:11,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:11,077 INFO L87 Difference]: Start difference. First operand has 441 states, 436 states have (on average 1.860091743119266) internal successors, (811), 440 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:11,203 INFO L93 Difference]: Finished difference Result 677 states and 1192 transitions. [2025-03-16 19:24:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:24:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:11,216 INFO L225 Difference]: With dead ends: 677 [2025-03-16 19:24:11,217 INFO L226 Difference]: Without dead ends: 553 [2025-03-16 19:24:11,219 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:24:11,221 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 405 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:11,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1362 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-16 19:24:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 546. [2025-03-16 19:24:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 542 states have (on average 1.3339483394833949) internal successors, (723), 545 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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:24:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 723 transitions. [2025-03-16 19:24:11,268 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 723 transitions. Word has length 49 [2025-03-16 19:24:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:11,268 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 723 transitions. [2025-03-16 19:24:11,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 723 transitions. [2025-03-16 19:24:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:24:11,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:11,271 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] [2025-03-16 19:24:11,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:24:11,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:11,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash -828716344, now seen corresponding path program 1 times [2025-03-16 19:24:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:11,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56894830] [2025-03-16 19:24:11,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:11,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:11,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:24:11,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:24:11,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:11,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:11,392 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:24:11,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:11,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56894830] [2025-03-16 19:24:11,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56894830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:11,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:11,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618882849] [2025-03-16 19:24:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:11,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:11,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:11,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:11,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:11,394 INFO L87 Difference]: Start difference. First operand 546 states and 723 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:11,438 INFO L93 Difference]: Finished difference Result 972 states and 1339 transitions. [2025-03-16 19:24:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:11,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:24:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:11,442 INFO L225 Difference]: With dead ends: 972 [2025-03-16 19:24:11,443 INFO L226 Difference]: Without dead ends: 724 [2025-03-16 19:24:11,445 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:24:11,446 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 236 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:11,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1017 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-16 19:24:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 718. [2025-03-16 19:24:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 714 states have (on average 1.3529411764705883) internal successors, (966), 717 states have internal predecessors, (966), 0 states have call successors, (0), 0 states 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:24:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 966 transitions. [2025-03-16 19:24:11,474 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 966 transitions. Word has length 49 [2025-03-16 19:24:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:11,475 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 966 transitions. [2025-03-16 19:24:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 966 transitions. [2025-03-16 19:24:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:24:11,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:11,478 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] [2025-03-16 19:24:11,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:24:11,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:11,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:11,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1632722658, now seen corresponding path program 1 times [2025-03-16 19:24:11,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:11,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800239524] [2025-03-16 19:24:11,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:11,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:11,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:24:11,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:24:11,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:11,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:11,646 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:24:11,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:11,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800239524] [2025-03-16 19:24:11,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800239524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:11,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:11,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:24:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866264491] [2025-03-16 19:24:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:11,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:11,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:11,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:11,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:11,647 INFO L87 Difference]: Start difference. First operand 718 states and 966 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:11,981 INFO L93 Difference]: Finished difference Result 1343 states and 1835 transitions. [2025-03-16 19:24:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:11,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:24:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:11,984 INFO L225 Difference]: With dead ends: 1343 [2025-03-16 19:24:11,984 INFO L226 Difference]: Without dead ends: 829 [2025-03-16 19:24:11,985 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:24:11,986 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 1689 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:11,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 391 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-16 19:24:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 820. [2025-03-16 19:24:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 816 states have (on average 1.3480392156862746) internal successors, (1100), 819 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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:24:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1100 transitions. [2025-03-16 19:24:12,005 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1100 transitions. Word has length 49 [2025-03-16 19:24:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:12,005 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1100 transitions. [2025-03-16 19:24:12,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1100 transitions. [2025-03-16 19:24:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:24:12,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:12,012 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] [2025-03-16 19:24:12,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:24:12,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:12,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash -996522306, now seen corresponding path program 1 times [2025-03-16 19:24:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:12,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189329] [2025-03-16 19:24:12,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:12,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:24:12,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:24:12,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:12,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:12,103 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:24:12,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:12,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189329] [2025-03-16 19:24:12,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:12,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:12,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203418366] [2025-03-16 19:24:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:12,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:12,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:12,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:12,104 INFO L87 Difference]: Start difference. First operand 820 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:12,143 INFO L93 Difference]: Finished difference Result 1763 states and 2438 transitions. [2025-03-16 19:24:12,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:24:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:12,148 INFO L225 Difference]: With dead ends: 1763 [2025-03-16 19:24:12,148 INFO L226 Difference]: Without dead ends: 1243 [2025-03-16 19:24:12,149 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:24:12,152 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 272 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:12,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 960 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-03-16 19:24:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1237. [2025-03-16 19:24:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1233 states have (on average 1.359286293592863) internal successors, (1676), 1236 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states 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:24:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1676 transitions. [2025-03-16 19:24:12,176 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1676 transitions. Word has length 50 [2025-03-16 19:24:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:12,176 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1676 transitions. [2025-03-16 19:24:12,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1676 transitions. [2025-03-16 19:24:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:24:12,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:12,178 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] [2025-03-16 19:24:12,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:24:12,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:12,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1429418077, now seen corresponding path program 1 times [2025-03-16 19:24:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359189568] [2025-03-16 19:24:12,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:12,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:24:12,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:24:12,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:12,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:12,283 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:24:12,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:12,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359189568] [2025-03-16 19:24:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359189568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:12,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:24:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262137336] [2025-03-16 19:24:12,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:12,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:12,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:12,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:12,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:12,287 INFO L87 Difference]: Start difference. First operand 1237 states and 1676 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:12,499 INFO L93 Difference]: Finished difference Result 2594 states and 3572 transitions. [2025-03-16 19:24:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:12,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:24:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:12,505 INFO L225 Difference]: With dead ends: 2594 [2025-03-16 19:24:12,506 INFO L226 Difference]: Without dead ends: 1553 [2025-03-16 19:24:12,507 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:24:12,508 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1478 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:12,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 349 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-03-16 19:24:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1161. [2025-03-16 19:24:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.3612791702679343) internal successors, (1575), 1160 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states 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:24:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1575 transitions. [2025-03-16 19:24:12,531 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1575 transitions. Word has length 50 [2025-03-16 19:24:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:12,532 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1575 transitions. [2025-03-16 19:24:12,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1575 transitions. [2025-03-16 19:24:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:24:12,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:12,533 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] [2025-03-16 19:24:12,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:24:12,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:12,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash 607370000, now seen corresponding path program 1 times [2025-03-16 19:24:12,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:12,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89333901] [2025-03-16 19:24:12,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:12,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:24:12,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:24:12,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:12,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:12,630 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:24:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:12,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89333901] [2025-03-16 19:24:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89333901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:12,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:12,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:24:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526807045] [2025-03-16 19:24:12,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:12,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:12,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:12,631 INFO L87 Difference]: Start difference. First operand 1161 states and 1575 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:12,840 INFO L93 Difference]: Finished difference Result 2587 states and 3547 transitions. [2025-03-16 19:24:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:24:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:12,846 INFO L225 Difference]: With dead ends: 2587 [2025-03-16 19:24:12,847 INFO L226 Difference]: Without dead ends: 1532 [2025-03-16 19:24:12,848 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:24:12,848 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1334 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:12,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 330 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-03-16 19:24:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1520. [2025-03-16 19:24:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1516 states have (on average 1.3647757255936674) internal successors, (2069), 1519 states have internal predecessors, (2069), 0 states have call successors, (0), 0 states 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:24:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2069 transitions. [2025-03-16 19:24:12,875 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2069 transitions. Word has length 50 [2025-03-16 19:24:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:12,876 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 2069 transitions. [2025-03-16 19:24:12,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2069 transitions. [2025-03-16 19:24:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:24:12,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:12,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:12,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:24:12,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:12,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1555320376, now seen corresponding path program 1 times [2025-03-16 19:24:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:12,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112191849] [2025-03-16 19:24:12,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:12,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:24:12,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:24:12,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:12,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:13,043 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:24:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:13,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112191849] [2025-03-16 19:24:13,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112191849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:13,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:13,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501880618] [2025-03-16 19:24:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:13,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:13,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:13,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:13,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:13,044 INFO L87 Difference]: Start difference. First operand 1520 states and 2069 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:13,361 INFO L93 Difference]: Finished difference Result 3019 states and 4170 transitions. [2025-03-16 19:24:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:24:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 19:24:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:13,368 INFO L225 Difference]: With dead ends: 3019 [2025-03-16 19:24:13,368 INFO L226 Difference]: Without dead ends: 2586 [2025-03-16 19:24:13,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:13,370 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 1846 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:13,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 610 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2025-03-16 19:24:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1532. [2025-03-16 19:24:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1528 states have (on average 1.3645287958115184) internal successors, (2085), 1531 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states 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:24:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2085 transitions. [2025-03-16 19:24:13,403 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2085 transitions. Word has length 51 [2025-03-16 19:24:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:13,403 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 2085 transitions. [2025-03-16 19:24:13,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2085 transitions. [2025-03-16 19:24:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:24:13,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:13,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:13,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:24:13,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:13,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:13,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1723279121, now seen corresponding path program 1 times [2025-03-16 19:24:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974539892] [2025-03-16 19:24:13,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:13,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:24:13,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:24:13,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:13,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:13,541 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:24:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974539892] [2025-03-16 19:24:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974539892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:13,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:13,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818484383] [2025-03-16 19:24:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:13,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:13,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:13,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:13,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:13,543 INFO L87 Difference]: Start difference. First operand 1532 states and 2085 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:13,844 INFO L93 Difference]: Finished difference Result 3011 states and 4151 transitions. [2025-03-16 19:24:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:24:13,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:24:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:13,850 INFO L225 Difference]: With dead ends: 3011 [2025-03-16 19:24:13,850 INFO L226 Difference]: Without dead ends: 2290 [2025-03-16 19:24:13,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:13,852 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1593 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:13,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 570 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-03-16 19:24:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1546. [2025-03-16 19:24:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1542 states have (on average 1.3638132295719845) internal successors, (2103), 1545 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states 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:24:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2103 transitions. [2025-03-16 19:24:13,884 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2103 transitions. Word has length 52 [2025-03-16 19:24:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:13,884 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2103 transitions. [2025-03-16 19:24:13,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2103 transitions. [2025-03-16 19:24:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:24:13,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:13,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:13,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:24:13,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:13,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:13,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1806612114, now seen corresponding path program 1 times [2025-03-16 19:24:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:13,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016959009] [2025-03-16 19:24:13,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:13,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:24:13,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:24:13,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:13,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:14,027 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:24:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:14,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016959009] [2025-03-16 19:24:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016959009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:14,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:14,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698434393] [2025-03-16 19:24:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:14,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:14,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:14,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:14,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:14,028 INFO L87 Difference]: Start difference. First operand 1546 states and 2103 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:14,354 INFO L93 Difference]: Finished difference Result 3305 states and 4586 transitions. [2025-03-16 19:24:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:24:14,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:24:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:14,361 INFO L225 Difference]: With dead ends: 3305 [2025-03-16 19:24:14,361 INFO L226 Difference]: Without dead ends: 2755 [2025-03-16 19:24:14,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:14,362 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1718 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:14,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 591 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-03-16 19:24:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1568. [2025-03-16 19:24:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1564 states have (on average 1.3644501278772379) internal successors, (2134), 1567 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states 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:24:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2134 transitions. [2025-03-16 19:24:14,398 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2134 transitions. Word has length 52 [2025-03-16 19:24:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:14,398 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2134 transitions. [2025-03-16 19:24:14,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2134 transitions. [2025-03-16 19:24:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:24:14,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:14,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:14,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:24:14,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:14,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1602302759, now seen corresponding path program 1 times [2025-03-16 19:24:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:14,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865973105] [2025-03-16 19:24:14,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:14,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:14,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:24:14,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:24:14,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:14,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:14,644 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:24:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865973105] [2025-03-16 19:24:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865973105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:14,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:14,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057362103] [2025-03-16 19:24:14,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:14,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:14,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:14,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:14,645 INFO L87 Difference]: Start difference. First operand 1568 states and 2134 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:15,017 INFO L93 Difference]: Finished difference Result 3263 states and 4519 transitions. [2025-03-16 19:24:15,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:24:15,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 19:24:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:15,022 INFO L225 Difference]: With dead ends: 3263 [2025-03-16 19:24:15,022 INFO L226 Difference]: Without dead ends: 2213 [2025-03-16 19:24:15,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:15,024 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1059 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:15,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 893 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2025-03-16 19:24:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1568. [2025-03-16 19:24:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1564 states have (on average 1.3612531969309463) internal successors, (2129), 1567 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states 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:24:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2129 transitions. [2025-03-16 19:24:15,049 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2129 transitions. Word has length 53 [2025-03-16 19:24:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2129 transitions. [2025-03-16 19:24:15,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2129 transitions. [2025-03-16 19:24:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:24:15,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:15,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:15,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:24:15,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:15,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 696708190, now seen corresponding path program 1 times [2025-03-16 19:24:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:15,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118937351] [2025-03-16 19:24:15,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:15,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:24:15,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:24:15,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:15,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:15,294 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:24:15,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:15,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118937351] [2025-03-16 19:24:15,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118937351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:15,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:15,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:24:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901383216] [2025-03-16 19:24:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:15,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:24:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:15,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:24:15,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:24:15,297 INFO L87 Difference]: Start difference. First operand 1568 states and 2129 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:15,748 INFO L93 Difference]: Finished difference Result 3630 states and 5035 transitions. [2025-03-16 19:24:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:24:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 19:24:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:15,755 INFO L225 Difference]: With dead ends: 3630 [2025-03-16 19:24:15,756 INFO L226 Difference]: Without dead ends: 2708 [2025-03-16 19:24:15,757 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:24:15,758 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1428 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:15,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 1027 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2025-03-16 19:24:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 1539. [2025-03-16 19:24:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1535 states have (on average 1.3602605863192183) internal successors, (2088), 1538 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:24:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2088 transitions. [2025-03-16 19:24:15,783 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2088 transitions. Word has length 53 [2025-03-16 19:24:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:15,784 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2088 transitions. [2025-03-16 19:24:15,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2088 transitions. [2025-03-16 19:24:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:24:15,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:15,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:15,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:24:15,785 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:15,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash 961885543, now seen corresponding path program 1 times [2025-03-16 19:24:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:15,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093731757] [2025-03-16 19:24:15,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:15,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:24:15,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:24:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:15,999 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:24:15,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:15,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093731757] [2025-03-16 19:24:15,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093731757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:15,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:15,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:24:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237766596] [2025-03-16 19:24:16,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:16,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:24:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:16,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:24:16,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:24:16,001 INFO L87 Difference]: Start difference. First operand 1539 states and 2088 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:16,441 INFO L93 Difference]: Finished difference Result 2261 states and 3081 transitions. [2025-03-16 19:24:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:24:16,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 19:24:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:16,446 INFO L225 Difference]: With dead ends: 2261 [2025-03-16 19:24:16,446 INFO L226 Difference]: Without dead ends: 2256 [2025-03-16 19:24:16,447 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:24:16,447 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 779 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:16,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1220 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:24:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-16 19:24:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1539. [2025-03-16 19:24:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1535 states have (on average 1.358957654723127) internal successors, (2086), 1538 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states 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:24:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2086 transitions. [2025-03-16 19:24:16,470 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2086 transitions. Word has length 53 [2025-03-16 19:24:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:16,470 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2086 transitions. [2025-03-16 19:24:16,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2086 transitions. [2025-03-16 19:24:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:24:16,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:16,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:16,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:24:16,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:16,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1461356337, now seen corresponding path program 1 times [2025-03-16 19:24:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926724166] [2025-03-16 19:24:16,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:16,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:24:16,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:24:16,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:16,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:16,515 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:24:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926724166] [2025-03-16 19:24:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926724166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:16,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:16,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062469427] [2025-03-16 19:24:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:16,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:16,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:16,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:16,516 INFO L87 Difference]: Start difference. First operand 1539 states and 2086 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:16,536 INFO L93 Difference]: Finished difference Result 2067 states and 2796 transitions. [2025-03-16 19:24:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:16,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 19:24:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:16,540 INFO L225 Difference]: With dead ends: 2067 [2025-03-16 19:24:16,540 INFO L226 Difference]: Without dead ends: 1508 [2025-03-16 19:24:16,541 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:24:16,541 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 257 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:16,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 672 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-03-16 19:24:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1506. [2025-03-16 19:24:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1502 states have (on average 1.329560585885486) internal successors, (1997), 1505 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states 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:24:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1997 transitions. [2025-03-16 19:24:16,559 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1997 transitions. Word has length 54 [2025-03-16 19:24:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:16,559 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1997 transitions. [2025-03-16 19:24:16,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1997 transitions. [2025-03-16 19:24:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:24:16,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:16,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:16,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:24:16,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:16,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2029177707, now seen corresponding path program 1 times [2025-03-16 19:24:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:16,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344907246] [2025-03-16 19:24:16,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:16,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:24:16,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:24:16,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:16,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:16,605 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:24:16,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:16,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344907246] [2025-03-16 19:24:16,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344907246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:16,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432269790] [2025-03-16 19:24:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:16,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:16,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:16,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:16,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:16,608 INFO L87 Difference]: Start difference. First operand 1506 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:16,627 INFO L93 Difference]: Finished difference Result 2163 states and 2894 transitions. [2025-03-16 19:24:16,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 19:24:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:16,630 INFO L225 Difference]: With dead ends: 2163 [2025-03-16 19:24:16,630 INFO L226 Difference]: Without dead ends: 1512 [2025-03-16 19:24:16,631 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:24:16,632 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 222 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:16,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 744 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-16 19:24:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1506. [2025-03-16 19:24:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1502 states have (on average 1.3175765645805593) internal successors, (1979), 1505 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states 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:24:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1979 transitions. [2025-03-16 19:24:16,649 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1979 transitions. Word has length 54 [2025-03-16 19:24:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:16,650 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1979 transitions. [2025-03-16 19:24:16,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1979 transitions. [2025-03-16 19:24:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:24:16,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:16,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:16,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:24:16,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:16,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash -205623313, now seen corresponding path program 1 times [2025-03-16 19:24:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:16,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599228747] [2025-03-16 19:24:16,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:16,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:16,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:24:16,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:24:16,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:16,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:16,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:16,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599228747] [2025-03-16 19:24:16,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599228747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:16,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423571243] [2025-03-16 19:24:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:16,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:16,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:16,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:16,697 INFO L87 Difference]: Start difference. First operand 1506 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:16,726 INFO L93 Difference]: Finished difference Result 2126 states and 2816 transitions. [2025-03-16 19:24:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:16,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 19:24:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:16,730 INFO L225 Difference]: With dead ends: 2126 [2025-03-16 19:24:16,730 INFO L226 Difference]: Without dead ends: 1513 [2025-03-16 19:24:16,735 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:24:16,736 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 206 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:16,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 739 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-03-16 19:24:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1506. [2025-03-16 19:24:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1502 states have (on average 1.3022636484687085) internal successors, (1956), 1505 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states 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:24:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1956 transitions. [2025-03-16 19:24:16,752 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1956 transitions. Word has length 54 [2025-03-16 19:24:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:16,752 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1956 transitions. [2025-03-16 19:24:16,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1956 transitions. [2025-03-16 19:24:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:24:16,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:16,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:16,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:24:16,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:16,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1609082639, now seen corresponding path program 1 times [2025-03-16 19:24:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:16,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128466352] [2025-03-16 19:24:16,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:16,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:24:16,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:24:16,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:16,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:17,551 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:24:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128466352] [2025-03-16 19:24:17,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128466352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:17,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:17,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 19:24:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109589012] [2025-03-16 19:24:17,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:17,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:24:17,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:17,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:24:17,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:24:17,553 INFO L87 Difference]: Start difference. First operand 1506 states and 1956 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:19,018 INFO L93 Difference]: Finished difference Result 2451 states and 3204 transitions. [2025-03-16 19:24:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:24:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 19:24:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:19,026 INFO L225 Difference]: With dead ends: 2451 [2025-03-16 19:24:19,028 INFO L226 Difference]: Without dead ends: 2447 [2025-03-16 19:24:19,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:24:19,030 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1988 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:19,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 3733 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:24:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-03-16 19:24:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 1518. [2025-03-16 19:24:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1514 states have (on average 1.3031704095112286) internal successors, (1973), 1517 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states 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:24:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1973 transitions. [2025-03-16 19:24:19,055 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1973 transitions. Word has length 56 [2025-03-16 19:24:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:19,055 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1973 transitions. [2025-03-16 19:24:19,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1973 transitions. [2025-03-16 19:24:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:24:19,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:19,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:19,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:24:19,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:19,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1116692203, now seen corresponding path program 1 times [2025-03-16 19:24:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:19,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377568810] [2025-03-16 19:24:19,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:19,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:19,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:24:19,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:24:19,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:19,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:19,424 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:24:19,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:19,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377568810] [2025-03-16 19:24:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377568810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:19,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:24:19,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898847435] [2025-03-16 19:24:19,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:19,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:24:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:19,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:24:19,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:24:19,425 INFO L87 Difference]: Start difference. First operand 1518 states and 1973 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:19,823 INFO L93 Difference]: Finished difference Result 2320 states and 3058 transitions. [2025-03-16 19:24:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:24:19,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 19:24:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:19,827 INFO L225 Difference]: With dead ends: 2320 [2025-03-16 19:24:19,830 INFO L226 Difference]: Without dead ends: 2094 [2025-03-16 19:24:19,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:24:19,832 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 1786 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:19,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 1391 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2025-03-16 19:24:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1460. [2025-03-16 19:24:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1457 states have (on average 1.304735758407687) internal successors, (1901), 1459 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states 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:24:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1901 transitions. [2025-03-16 19:24:19,884 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1901 transitions. Word has length 56 [2025-03-16 19:24:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:19,885 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 1901 transitions. [2025-03-16 19:24:19,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1901 transitions. [2025-03-16 19:24:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:24:19,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:19,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:19,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:24:19,886 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:19,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash -179698076, now seen corresponding path program 1 times [2025-03-16 19:24:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:19,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752051629] [2025-03-16 19:24:19,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:19,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:19,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:24:19,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:24:19,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:19,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:19,927 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:24:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752051629] [2025-03-16 19:24:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752051629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:19,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145105781] [2025-03-16 19:24:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:19,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:19,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:19,929 INFO L87 Difference]: Start difference. First operand 1460 states and 1901 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:19,976 INFO L93 Difference]: Finished difference Result 2570 states and 3384 transitions. [2025-03-16 19:24:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 19:24:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:19,979 INFO L225 Difference]: With dead ends: 2570 [2025-03-16 19:24:19,979 INFO L226 Difference]: Without dead ends: 1718 [2025-03-16 19:24:19,980 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:24:19,983 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 242 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:19,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 372 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:19,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-16 19:24:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1345. [2025-03-16 19:24:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1343 states have (on average 1.3097542814594192) internal successors, (1759), 1344 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states 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:24:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1759 transitions. [2025-03-16 19:24:19,996 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1759 transitions. Word has length 56 [2025-03-16 19:24:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:19,996 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1759 transitions. [2025-03-16 19:24:20,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1759 transitions. [2025-03-16 19:24:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 19:24:20,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:20,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:20,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:24:20,002 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:20,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1938290114, now seen corresponding path program 1 times [2025-03-16 19:24:20,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:20,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460974476] [2025-03-16 19:24:20,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:20,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:20,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 19:24:20,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 19:24:20,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:20,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:20,313 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:24:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460974476] [2025-03-16 19:24:20,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460974476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:24:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880131714] [2025-03-16 19:24:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:20,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:24:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:20,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:24:20,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:24:20,314 INFO L87 Difference]: Start difference. First operand 1345 states and 1759 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:20,662 INFO L93 Difference]: Finished difference Result 2346 states and 3113 transitions. [2025-03-16 19:24:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:24:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 19:24:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:20,666 INFO L225 Difference]: With dead ends: 2346 [2025-03-16 19:24:20,666 INFO L226 Difference]: Without dead ends: 2135 [2025-03-16 19:24:20,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:24:20,667 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 1056 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:20,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1419 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:20,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2025-03-16 19:24:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1308. [2025-03-16 19:24:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1307 states have (on average 1.3098699311400153) internal successors, (1712), 1307 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states 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:24:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1712 transitions. [2025-03-16 19:24:20,685 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1712 transitions. Word has length 57 [2025-03-16 19:24:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:20,685 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1712 transitions. [2025-03-16 19:24:20,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1712 transitions. [2025-03-16 19:24:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:24:20,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:20,687 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:24:20,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:24:20,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:20,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1550247575, now seen corresponding path program 1 times [2025-03-16 19:24:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:20,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107855026] [2025-03-16 19:24:20,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:20,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:20,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:24:20,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:24:20,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:20,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:20,787 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:24:20,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107855026] [2025-03-16 19:24:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107855026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062105470] [2025-03-16 19:24:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:20,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:20,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:20,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:20,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:20,789 INFO L87 Difference]: Start difference. First operand 1308 states and 1712 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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:24:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:20,845 INFO L93 Difference]: Finished difference Result 3039 states and 4112 transitions. [2025-03-16 19:24:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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:24:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:20,849 INFO L225 Difference]: With dead ends: 3039 [2025-03-16 19:24:20,849 INFO L226 Difference]: Without dead ends: 2305 [2025-03-16 19:24:20,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:24:20,852 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 937 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:20,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 613 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-03-16 19:24:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 1980. [2025-03-16 19:24:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1980 states, 1979 states have (on average 1.3158160687215765) internal successors, (2604), 1979 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states 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:24:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 2604 transitions. [2025-03-16 19:24:20,873 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 2604 transitions. Word has length 65 [2025-03-16 19:24:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:20,873 INFO L471 AbstractCegarLoop]: Abstraction has 1980 states and 2604 transitions. [2025-03-16 19:24:20,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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:24:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2604 transitions. [2025-03-16 19:24:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:24:20,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:20,875 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:24:20,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:24:20,875 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:20,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:20,876 INFO L85 PathProgramCache]: Analyzing trace with hash -783448910, now seen corresponding path program 1 times [2025-03-16 19:24:20,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:20,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294263726] [2025-03-16 19:24:20,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:20,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:24:20,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:24:20,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:20,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:20,947 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:24:20,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:20,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294263726] [2025-03-16 19:24:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294263726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:20,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:20,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565974947] [2025-03-16 19:24:20,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:20,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:20,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:20,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:20,950 INFO L87 Difference]: Start difference. First operand 1980 states and 2604 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:24:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:21,002 INFO L93 Difference]: Finished difference Result 1986 states and 2607 transitions. [2025-03-16 19:24:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:21,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:24:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:21,004 INFO L225 Difference]: With dead ends: 1986 [2025-03-16 19:24:21,004 INFO L226 Difference]: Without dead ends: 1763 [2025-03-16 19:24:21,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:21,005 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 513 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:21,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 628 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-03-16 19:24:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1759. [2025-03-16 19:24:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1758 states have (on average 1.3202502844141069) internal successors, (2321), 1758 states have internal predecessors, (2321), 0 states have call successors, (0), 0 states 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:24:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2321 transitions. [2025-03-16 19:24:21,021 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2321 transitions. Word has length 66 [2025-03-16 19:24:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:21,021 INFO L471 AbstractCegarLoop]: Abstraction has 1759 states and 2321 transitions. [2025-03-16 19:24:21,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:24:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2321 transitions. [2025-03-16 19:24:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:24:21,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:21,023 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:24:21,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:24:21,023 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:21,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1804394879, now seen corresponding path program 1 times [2025-03-16 19:24:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:21,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959900613] [2025-03-16 19:24:21,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:21,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:24:21,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:24:21,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:21,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:21,095 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:24:21,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959900613] [2025-03-16 19:24:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959900613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:21,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117139100] [2025-03-16 19:24:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:21,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:21,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:21,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:21,096 INFO L87 Difference]: Start difference. First operand 1759 states and 2321 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:21,122 INFO L93 Difference]: Finished difference Result 4015 states and 5407 transitions. [2025-03-16 19:24:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:21,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:24:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:21,126 INFO L225 Difference]: With dead ends: 4015 [2025-03-16 19:24:21,126 INFO L226 Difference]: Without dead ends: 2837 [2025-03-16 19:24:21,127 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:24:21,129 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 104 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:21,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 516 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2025-03-16 19:24:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2651. [2025-03-16 19:24:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 2650 states have (on average 1.329433962264151) internal successors, (3523), 2650 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states 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:24:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3523 transitions. [2025-03-16 19:24:21,153 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3523 transitions. Word has length 67 [2025-03-16 19:24:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:21,154 INFO L471 AbstractCegarLoop]: Abstraction has 2651 states and 3523 transitions. [2025-03-16 19:24:21,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3523 transitions. [2025-03-16 19:24:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:24:21,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:21,156 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:24:21,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:24:21,156 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1214177106, now seen corresponding path program 1 times [2025-03-16 19:24:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:21,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001295367] [2025-03-16 19:24:21,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:21,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:24:21,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:24:21,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:21,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:21,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:24:21,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:21,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001295367] [2025-03-16 19:24:21,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001295367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:21,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510840808] [2025-03-16 19:24:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:21,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:21,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:21,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:21,229 INFO L87 Difference]: Start difference. First operand 2651 states and 3523 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:24:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:21,255 INFO L93 Difference]: Finished difference Result 6571 states and 8817 transitions. [2025-03-16 19:24:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:21,256 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:24:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:21,261 INFO L225 Difference]: With dead ends: 6571 [2025-03-16 19:24:21,261 INFO L226 Difference]: Without dead ends: 4385 [2025-03-16 19:24:21,263 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:24:21,264 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 104 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:21,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 519 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2025-03-16 19:24:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 4127. [2025-03-16 19:24:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 4126 states have (on average 1.3250121182743577) internal successors, (5467), 4126 states have internal predecessors, (5467), 0 states have call successors, (0), 0 states 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:24:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 5467 transitions. [2025-03-16 19:24:21,321 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 5467 transitions. Word has length 69 [2025-03-16 19:24:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:21,321 INFO L471 AbstractCegarLoop]: Abstraction has 4127 states and 5467 transitions. [2025-03-16 19:24:21,322 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:24:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 5467 transitions. [2025-03-16 19:24:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:24:21,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:21,324 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:24:21,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:24:21,324 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:21,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash 27635850, now seen corresponding path program 1 times [2025-03-16 19:24:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090366421] [2025-03-16 19:24:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:21,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:24:21,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:24:21,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:21,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:21,388 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:24:21,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090366421] [2025-03-16 19:24:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090366421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279751422] [2025-03-16 19:24:21,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:21,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:21,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:21,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:21,390 INFO L87 Difference]: Start difference. First operand 4127 states and 5467 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:24:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:21,432 INFO L93 Difference]: Finished difference Result 11011 states and 14709 transitions. [2025-03-16 19:24:21,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:21,433 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:24:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:21,444 INFO L225 Difference]: With dead ends: 11011 [2025-03-16 19:24:21,444 INFO L226 Difference]: Without dead ends: 7369 [2025-03-16 19:24:21,449 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:24:21,449 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 81 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:21,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 490 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7369 states. [2025-03-16 19:24:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7369 to 6759. [2025-03-16 19:24:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6759 states, 6758 states have (on average 1.3197691624741048) internal successors, (8919), 6758 states have internal predecessors, (8919), 0 states have call successors, (0), 0 states 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:24:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6759 states to 6759 states and 8919 transitions. [2025-03-16 19:24:21,521 INFO L78 Accepts]: Start accepts. Automaton has 6759 states and 8919 transitions. Word has length 69 [2025-03-16 19:24:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:21,522 INFO L471 AbstractCegarLoop]: Abstraction has 6759 states and 8919 transitions. [2025-03-16 19:24:21,522 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:24:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6759 states and 8919 transitions. [2025-03-16 19:24:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:24:21,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:21,523 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:24:21,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:24:21,523 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:21,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2102018141, now seen corresponding path program 1 times [2025-03-16 19:24:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908819223] [2025-03-16 19:24:21,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:21,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:24:21,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:24:21,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:21,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:21,681 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:24:21,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908819223] [2025-03-16 19:24:21,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908819223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:21,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:21,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:21,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720841376] [2025-03-16 19:24:21,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:21,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:24:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:21,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:24:21,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:24:21,683 INFO L87 Difference]: Start difference. First operand 6759 states and 8919 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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:24:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:21,757 INFO L93 Difference]: Finished difference Result 7433 states and 9816 transitions. [2025-03-16 19:24:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:24:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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:24:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:21,767 INFO L225 Difference]: With dead ends: 7433 [2025-03-16 19:24:21,767 INFO L226 Difference]: Without dead ends: 7431 [2025-03-16 19:24:21,769 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:24:21,770 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:21,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1189 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2025-03-16 19:24:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7431. [2025-03-16 19:24:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7431 states, 7430 states have (on average 1.2908479138627187) internal successors, (9591), 7430 states have internal predecessors, (9591), 0 states have call successors, (0), 0 states 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:24:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7431 states to 7431 states and 9591 transitions. [2025-03-16 19:24:21,870 INFO L78 Accepts]: Start accepts. Automaton has 7431 states and 9591 transitions. Word has length 71 [2025-03-16 19:24:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:21,872 INFO L471 AbstractCegarLoop]: Abstraction has 7431 states and 9591 transitions. [2025-03-16 19:24:21,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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:24:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 7431 states and 9591 transitions. [2025-03-16 19:24:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:24:21,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:21,874 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:24:21,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:24:21,874 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:21,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:21,875 INFO L85 PathProgramCache]: Analyzing trace with hash 885849278, now seen corresponding path program 1 times [2025-03-16 19:24:21,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:21,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953972744] [2025-03-16 19:24:21,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:21,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:21,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:24:21,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:24:21,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:21,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:21,926 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:24:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953972744] [2025-03-16 19:24:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953972744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185540412] [2025-03-16 19:24:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:21,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:21,928 INFO L87 Difference]: Start difference. First operand 7431 states and 9591 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:24:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:21,979 INFO L93 Difference]: Finished difference Result 17811 states and 22977 transitions. [2025-03-16 19:24:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:21,979 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:24:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:21,996 INFO L225 Difference]: With dead ends: 17811 [2025-03-16 19:24:21,996 INFO L226 Difference]: Without dead ends: 10865 [2025-03-16 19:24:22,005 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:24:22,006 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 176 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:22,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 352 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10865 states. [2025-03-16 19:24:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10865 to 10863. [2025-03-16 19:24:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10863 states, 10862 states have (on average 1.2718652181918615) internal successors, (13815), 10862 states have internal predecessors, (13815), 0 states have call successors, (0), 0 states 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:24:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 13815 transitions. [2025-03-16 19:24:22,122 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 13815 transitions. Word has length 72 [2025-03-16 19:24:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:22,122 INFO L471 AbstractCegarLoop]: Abstraction has 10863 states and 13815 transitions. [2025-03-16 19:24:22,122 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:24:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 13815 transitions. [2025-03-16 19:24:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:24:22,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:22,124 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:24:22,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:24:22,124 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:22,125 INFO L85 PathProgramCache]: Analyzing trace with hash 373267482, now seen corresponding path program 1 times [2025-03-16 19:24:22,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:22,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161758877] [2025-03-16 19:24:22,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:22,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:22,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:24:22,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:24:22,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:22,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:22,192 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:24:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:22,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161758877] [2025-03-16 19:24:22,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161758877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:22,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:22,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:22,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619304329] [2025-03-16 19:24:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:22,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:22,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:22,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:22,193 INFO L87 Difference]: Start difference. First operand 10863 states and 13815 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:22,263 INFO L93 Difference]: Finished difference Result 16003 states and 20491 transitions. [2025-03-16 19:24:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 19:24:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:22,285 INFO L225 Difference]: With dead ends: 16003 [2025-03-16 19:24:22,285 INFO L226 Difference]: Without dead ends: 13637 [2025-03-16 19:24:22,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:22,291 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 577 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:22,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 731 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13637 states. [2025-03-16 19:24:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13637 to 12413. [2025-03-16 19:24:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.2696583951015146) internal successors, (15759), 12412 states have internal predecessors, (15759), 0 states have call successors, (0), 0 states 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:24:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 15759 transitions. [2025-03-16 19:24:22,454 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 15759 transitions. Word has length 73 [2025-03-16 19:24:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:22,455 INFO L471 AbstractCegarLoop]: Abstraction has 12413 states and 15759 transitions. [2025-03-16 19:24:22,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 15759 transitions. [2025-03-16 19:24:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:24:22,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:22,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:22,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:24:22,460 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:22,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1868572099, now seen corresponding path program 1 times [2025-03-16 19:24:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117305365] [2025-03-16 19:24:22,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:22,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:24:22,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:24:22,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:22,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117305365] [2025-03-16 19:24:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117305365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029554479] [2025-03-16 19:24:22,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:22,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:22,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:22,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:22,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:24:22,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:24:22,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:24:22,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:22,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:22,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:24:22,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:23,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:23,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029554479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:23,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:23,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2025-03-16 19:24:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415624536] [2025-03-16 19:24:23,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:24:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:23,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:24:23,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:24:23,510 INFO L87 Difference]: Start difference. First operand 12413 states and 15759 transitions. Second operand has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:24:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:24,111 INFO L93 Difference]: Finished difference Result 51448 states and 65676 transitions. [2025-03-16 19:24:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:24:24,112 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-16 19:24:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:24,155 INFO L225 Difference]: With dead ends: 51448 [2025-03-16 19:24:24,155 INFO L226 Difference]: Without dead ends: 39520 [2025-03-16 19:24:24,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:24:24,174 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 1625 mSDsluCounter, 2656 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:24,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 3150 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39520 states. [2025-03-16 19:24:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39520 to 32903. [2025-03-16 19:24:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32903 states, 32902 states have (on average 1.2640872895264725) internal successors, (41591), 32902 states have internal predecessors, (41591), 0 states have call successors, (0), 0 states 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:24:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32903 states to 32903 states and 41591 transitions. [2025-03-16 19:24:24,544 INFO L78 Accepts]: Start accepts. Automaton has 32903 states and 41591 transitions. Word has length 91 [2025-03-16 19:24:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:24,544 INFO L471 AbstractCegarLoop]: Abstraction has 32903 states and 41591 transitions. [2025-03-16 19:24:24,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:24:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32903 states and 41591 transitions. [2025-03-16 19:24:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:24:24,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:24,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:24,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:24:24,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 19:24:24,750 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:24,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash -972382623, now seen corresponding path program 1 times [2025-03-16 19:24:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396157829] [2025-03-16 19:24:24,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:24,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:24:24,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:24:24,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:24,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396157829] [2025-03-16 19:24:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396157829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629485604] [2025-03-16 19:24:24,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:24,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:24,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:24,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:24,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:24:24,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:24:24,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:24:24,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:24,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:25,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:24:25,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:25,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629485604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:25,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:25,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-16 19:24:25,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060514494] [2025-03-16 19:24:25,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:24:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:25,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:24:25,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:24:25,344 INFO L87 Difference]: Start difference. First operand 32903 states and 41591 transitions. Second operand has 14 states, 14 states have (on average 17.642857142857142) internal successors, (247), 14 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:24:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:25,912 INFO L93 Difference]: Finished difference Result 61587 states and 77846 transitions. [2025-03-16 19:24:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:24:25,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.642857142857142) internal successors, (247), 14 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-16 19:24:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:25,950 INFO L225 Difference]: With dead ends: 61587 [2025-03-16 19:24:25,951 INFO L226 Difference]: Without dead ends: 29121 [2025-03-16 19:24:25,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:24:25,973 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1660 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:25,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 1043 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29121 states. [2025-03-16 19:24:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29121 to 28913. [2025-03-16 19:24:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28913 states, 28912 states have (on average 1.236199501936912) internal successors, (35741), 28912 states have internal predecessors, (35741), 0 states have call successors, (0), 0 states 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:24:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28913 states to 28913 states and 35741 transitions. [2025-03-16 19:24:26,341 INFO L78 Accepts]: Start accepts. Automaton has 28913 states and 35741 transitions. Word has length 92 [2025-03-16 19:24:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:26,341 INFO L471 AbstractCegarLoop]: Abstraction has 28913 states and 35741 transitions. [2025-03-16 19:24:26,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.642857142857142) internal successors, (247), 14 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:24:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 28913 states and 35741 transitions. [2025-03-16 19:24:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:24:26,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:26,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:26,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:24:26,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 19:24:26,553 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash -180022083, now seen corresponding path program 1 times [2025-03-16 19:24:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919357653] [2025-03-16 19:24:26,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:26,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:24:26,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:24:26,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:26,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:26,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919357653] [2025-03-16 19:24:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919357653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:26,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:26,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:26,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57245298] [2025-03-16 19:24:26,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:26,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:26,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:26,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:26,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:26,641 INFO L87 Difference]: Start difference. First operand 28913 states and 35741 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:26,876 INFO L93 Difference]: Finished difference Result 58403 states and 72078 transitions. [2025-03-16 19:24:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:24:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:24:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:26,910 INFO L225 Difference]: With dead ends: 58403 [2025-03-16 19:24:26,910 INFO L226 Difference]: Without dead ends: 29963 [2025-03-16 19:24:26,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:24:26,929 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 429 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:26,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 433 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29963 states. [2025-03-16 19:24:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29963 to 27865. [2025-03-16 19:24:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27865 states, 27864 states have (on average 1.2113838644846397) internal successors, (33754), 27864 states have internal predecessors, (33754), 0 states have call successors, (0), 0 states 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:24:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27865 states to 27865 states and 33754 transitions. [2025-03-16 19:24:27,254 INFO L78 Accepts]: Start accepts. Automaton has 27865 states and 33754 transitions. Word has length 94 [2025-03-16 19:24:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:27,254 INFO L471 AbstractCegarLoop]: Abstraction has 27865 states and 33754 transitions. [2025-03-16 19:24:27,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27865 states and 33754 transitions. [2025-03-16 19:24:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:24:27,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:27,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:27,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:24:27,260 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash 64420468, now seen corresponding path program 1 times [2025-03-16 19:24:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007220807] [2025-03-16 19:24:27,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:27,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:24:27,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:24:27,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:27,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:24:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:27,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007220807] [2025-03-16 19:24:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007220807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:27,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969098784] [2025-03-16 19:24:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:27,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:27,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:27,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:27,337 INFO L87 Difference]: Start difference. First operand 27865 states and 33754 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:27,433 INFO L93 Difference]: Finished difference Result 34669 states and 42192 transitions. [2025-03-16 19:24:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 97 [2025-03-16 19:24:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:27,464 INFO L225 Difference]: With dead ends: 34669 [2025-03-16 19:24:27,464 INFO L226 Difference]: Without dead ends: 31445 [2025-03-16 19:24:27,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:27,474 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 517 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:27,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 691 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31445 states. [2025-03-16 19:24:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31445 to 30488. [2025-03-16 19:24:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30488 states, 30487 states have (on average 1.2100239446321384) internal successors, (36890), 30487 states have internal predecessors, (36890), 0 states have call successors, (0), 0 states 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:24:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30488 states to 30488 states and 36890 transitions. [2025-03-16 19:24:27,739 INFO L78 Accepts]: Start accepts. Automaton has 30488 states and 36890 transitions. Word has length 97 [2025-03-16 19:24:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:27,739 INFO L471 AbstractCegarLoop]: Abstraction has 30488 states and 36890 transitions. [2025-03-16 19:24:27,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 30488 states and 36890 transitions. [2025-03-16 19:24:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:24:27,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:27,744 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:27,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:24:27,745 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:27,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2004830362, now seen corresponding path program 1 times [2025-03-16 19:24:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195935424] [2025-03-16 19:24:27,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:27,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:24:27,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:24:27,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:27,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:27,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195935424] [2025-03-16 19:24:27,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195935424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:27,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:27,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213800244] [2025-03-16 19:24:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:27,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:27,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:27,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:27,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:27,950 INFO L87 Difference]: Start difference. First operand 30488 states and 36890 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:24:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:28,055 INFO L93 Difference]: Finished difference Result 43050 states and 52521 transitions. [2025-03-16 19:24:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 19:24:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:28,091 INFO L225 Difference]: With dead ends: 43050 [2025-03-16 19:24:28,092 INFO L226 Difference]: Without dead ends: 35490 [2025-03-16 19:24:28,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:28,106 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 525 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:28,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 683 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35490 states. [2025-03-16 19:24:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35490 to 34533. [2025-03-16 19:24:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34533 states, 34532 states have (on average 1.205085138422333) internal successors, (41614), 34532 states have internal predecessors, (41614), 0 states have call successors, (0), 0 states 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:24:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34533 states to 34533 states and 41614 transitions. [2025-03-16 19:24:28,401 INFO L78 Accepts]: Start accepts. Automaton has 34533 states and 41614 transitions. Word has length 98 [2025-03-16 19:24:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:28,402 INFO L471 AbstractCegarLoop]: Abstraction has 34533 states and 41614 transitions. [2025-03-16 19:24:28,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:24:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 34533 states and 41614 transitions. [2025-03-16 19:24:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:24:28,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:28,407 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:28,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:24:28,407 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:28,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2075102954, now seen corresponding path program 1 times [2025-03-16 19:24:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703915531] [2025-03-16 19:24:28,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:28,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:24:28,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:24:28,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:28,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:24:28,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:28,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703915531] [2025-03-16 19:24:28,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703915531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:28,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:28,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:28,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456604948] [2025-03-16 19:24:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:28,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:28,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:28,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:28,501 INFO L87 Difference]: Start difference. First operand 34533 states and 41614 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:24:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:28,893 INFO L93 Difference]: Finished difference Result 60006 states and 72362 transitions. [2025-03-16 19:24:28,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:24:28,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 102 [2025-03-16 19:24:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:28,941 INFO L225 Difference]: With dead ends: 60006 [2025-03-16 19:24:28,941 INFO L226 Difference]: Without dead ends: 48554 [2025-03-16 19:24:28,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:28,955 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1056 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:28,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 468 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48554 states. [2025-03-16 19:24:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48554 to 34578. [2025-03-16 19:24:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34578 states, 34577 states have (on average 1.2050206784856985) internal successors, (41666), 34577 states have internal predecessors, (41666), 0 states have call successors, (0), 0 states 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:24:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34578 states to 34578 states and 41666 transitions. [2025-03-16 19:24:29,280 INFO L78 Accepts]: Start accepts. Automaton has 34578 states and 41666 transitions. Word has length 102 [2025-03-16 19:24:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:29,280 INFO L471 AbstractCegarLoop]: Abstraction has 34578 states and 41666 transitions. [2025-03-16 19:24:29,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:24:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34578 states and 41666 transitions. [2025-03-16 19:24:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:24:29,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:29,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:29,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:24:29,286 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:29,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1530704786, now seen corresponding path program 1 times [2025-03-16 19:24:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:29,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640705384] [2025-03-16 19:24:29,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:29,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:24:29,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:24:29,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:29,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:29,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640705384] [2025-03-16 19:24:29,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640705384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967336966] [2025-03-16 19:24:29,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:29,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:29,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:29,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:29,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:24:29,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:24:29,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:24:29,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:29,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:29,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:24:29,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:29,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:30,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967336966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:30,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:30,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-16 19:24:30,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133863385] [2025-03-16 19:24:30,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:30,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:24:30,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:30,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:24:30,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:24:30,006 INFO L87 Difference]: Start difference. First operand 34578 states and 41666 transitions. Second operand has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:24:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:30,450 INFO L93 Difference]: Finished difference Result 82233 states and 99659 transitions. [2025-03-16 19:24:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:24:30,450 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 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 103 [2025-03-16 19:24:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:30,498 INFO L225 Difference]: With dead ends: 82233 [2025-03-16 19:24:30,498 INFO L226 Difference]: Without dead ends: 48173 [2025-03-16 19:24:30,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:24:30,524 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1217 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:30,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 867 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48173 states. [2025-03-16 19:24:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48173 to 40121. [2025-03-16 19:24:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40121 states, 40120 states have (on average 1.1916500498504488) internal successors, (47809), 40120 states have internal predecessors, (47809), 0 states have call successors, (0), 0 states 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:24:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40121 states to 40121 states and 47809 transitions. [2025-03-16 19:24:31,013 INFO L78 Accepts]: Start accepts. Automaton has 40121 states and 47809 transitions. Word has length 103 [2025-03-16 19:24:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:31,013 INFO L471 AbstractCegarLoop]: Abstraction has 40121 states and 47809 transitions. [2025-03-16 19:24:31,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:24:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 40121 states and 47809 transitions. [2025-03-16 19:24:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:24:31,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:31,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:31,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:24:31,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:31,221 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:31,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash -441964833, now seen corresponding path program 1 times [2025-03-16 19:24:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799892257] [2025-03-16 19:24:31,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:31,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:24:31,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:24:31,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:31,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:24:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799892257] [2025-03-16 19:24:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799892257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:24:31,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821518061] [2025-03-16 19:24:31,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:31,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:24:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:31,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:24:31,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:24:31,456 INFO L87 Difference]: Start difference. First operand 40121 states and 47809 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:24:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:31,924 INFO L93 Difference]: Finished difference Result 101843 states and 121713 transitions. [2025-03-16 19:24:31,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:24:31,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 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 104 [2025-03-16 19:24:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:31,995 INFO L225 Difference]: With dead ends: 101843 [2025-03-16 19:24:31,995 INFO L226 Difference]: Without dead ends: 70369 [2025-03-16 19:24:32,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:24:32,028 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 922 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:32,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 712 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70369 states. [2025-03-16 19:24:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70369 to 40053. [2025-03-16 19:24:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40053 states, 40052 states have (on average 1.1917257565165285) internal successors, (47731), 40052 states have internal predecessors, (47731), 0 states have call successors, (0), 0 states 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:24:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40053 states to 40053 states and 47731 transitions. [2025-03-16 19:24:32,593 INFO L78 Accepts]: Start accepts. Automaton has 40053 states and 47731 transitions. Word has length 104 [2025-03-16 19:24:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:32,594 INFO L471 AbstractCegarLoop]: Abstraction has 40053 states and 47731 transitions. [2025-03-16 19:24:32,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:24:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 40053 states and 47731 transitions. [2025-03-16 19:24:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:24:32,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:32,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:32,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:24:32,599 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:32,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1720323676, now seen corresponding path program 1 times [2025-03-16 19:24:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094575961] [2025-03-16 19:24:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:32,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:24:32,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:24:32,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:32,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:24:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094575961] [2025-03-16 19:24:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094575961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:32,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:32,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:32,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393814984] [2025-03-16 19:24:32,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:32,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:32,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:32,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:32,634 INFO L87 Difference]: Start difference. First operand 40053 states and 47731 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:24:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:32,751 INFO L93 Difference]: Finished difference Result 72062 states and 85936 transitions. [2025-03-16 19:24:32,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:32,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 106 [2025-03-16 19:24:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:32,796 INFO L225 Difference]: With dead ends: 72062 [2025-03-16 19:24:32,796 INFO L226 Difference]: Without dead ends: 48924 [2025-03-16 19:24:32,815 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:24:32,815 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 174 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:32,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 309 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48924 states. [2025-03-16 19:24:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48924 to 35866. [2025-03-16 19:24:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35866 states, 35865 states have (on average 1.1845810678934894) internal successors, (42485), 35865 states have internal predecessors, (42485), 0 states have call successors, (0), 0 states 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:24:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35866 states to 35866 states and 42485 transitions. [2025-03-16 19:24:33,140 INFO L78 Accepts]: Start accepts. Automaton has 35866 states and 42485 transitions. Word has length 106 [2025-03-16 19:24:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:33,140 INFO L471 AbstractCegarLoop]: Abstraction has 35866 states and 42485 transitions. [2025-03-16 19:24:33,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:24:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 35866 states and 42485 transitions. [2025-03-16 19:24:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:24:33,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:33,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:24:33,144 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:33,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1337117962, now seen corresponding path program 1 times [2025-03-16 19:24:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645126554] [2025-03-16 19:24:33,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:33,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:24:33,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:24:33,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:33,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:33,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645126554] [2025-03-16 19:24:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645126554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66245395] [2025-03-16 19:24:33,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:33,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:33,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:33,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:24:33,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:24:33,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:24:33,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:33,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:33,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:24:33,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:34,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66245395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:34,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 31 [2025-03-16 19:24:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409904490] [2025-03-16 19:24:34,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:34,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 19:24:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:34,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 19:24:34,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:24:34,872 INFO L87 Difference]: Start difference. First operand 35866 states and 42485 transitions. Second operand has 31 states, 31 states have (on average 8.451612903225806) internal successors, (262), 31 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:24:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:36,081 INFO L93 Difference]: Finished difference Result 141808 states and 169002 transitions. [2025-03-16 19:24:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:24:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.451612903225806) internal successors, (262), 31 states have internal predecessors, (262), 0 states have call successors, (0), 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 107 [2025-03-16 19:24:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:36,204 INFO L225 Difference]: With dead ends: 141808 [2025-03-16 19:24:36,204 INFO L226 Difference]: Without dead ends: 128854 [2025-03-16 19:24:36,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=440, Invalid=2212, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 19:24:36,315 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 2614 mSDsluCounter, 5053 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2614 SdHoareTripleChecker+Valid, 5363 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:36,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2614 Valid, 5363 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:24:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128854 states. [2025-03-16 19:24:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128854 to 36130. [2025-03-16 19:24:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36130 states, 36129 states have (on average 1.1843948074953639) internal successors, (42791), 36129 states have internal predecessors, (42791), 0 states have call successors, (0), 0 states 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:24:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36130 states to 36130 states and 42791 transitions. [2025-03-16 19:24:36,943 INFO L78 Accepts]: Start accepts. Automaton has 36130 states and 42791 transitions. Word has length 107 [2025-03-16 19:24:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:36,943 INFO L471 AbstractCegarLoop]: Abstraction has 36130 states and 42791 transitions. [2025-03-16 19:24:36,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.451612903225806) internal successors, (262), 31 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:24:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 36130 states and 42791 transitions. [2025-03-16 19:24:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:24:36,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:36,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:36,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 19:24:37,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-16 19:24:37,149 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:37,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1720365827, now seen corresponding path program 1 times [2025-03-16 19:24:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284373918] [2025-03-16 19:24:37,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:37,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:24:37,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:24:37,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:37,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284373918] [2025-03-16 19:24:37,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284373918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758839428] [2025-03-16 19:24:37,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:37,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:37,524 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:37,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 19:24:37,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:24:37,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:24:37,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:37,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:37,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 19:24:37,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:38,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:24:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758839428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:38,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:24:38,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2025-03-16 19:24:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534308625] [2025-03-16 19:24:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:38,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:24:38,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:38,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:24:38,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:24:38,170 INFO L87 Difference]: Start difference. First operand 36130 states and 42791 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:24:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:38,466 INFO L93 Difference]: Finished difference Result 57509 states and 68203 transitions. [2025-03-16 19:24:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:24:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-16 19:24:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:38,507 INFO L225 Difference]: With dead ends: 57509 [2025-03-16 19:24:38,507 INFO L226 Difference]: Without dead ends: 45439 [2025-03-16 19:24:38,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:24:38,524 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 326 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:38,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 2371 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45439 states. [2025-03-16 19:24:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45439 to 44691. [2025-03-16 19:24:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44691 states, 44690 states have (on average 1.1842917878720072) internal successors, (52926), 44690 states have internal predecessors, (52926), 0 states have call successors, (0), 0 states 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:24:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44691 states to 44691 states and 52926 transitions. [2025-03-16 19:24:38,947 INFO L78 Accepts]: Start accepts. Automaton has 44691 states and 52926 transitions. Word has length 107 [2025-03-16 19:24:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:38,947 INFO L471 AbstractCegarLoop]: Abstraction has 44691 states and 52926 transitions. [2025-03-16 19:24:38,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:24:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 44691 states and 52926 transitions. [2025-03-16 19:24:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:24:38,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:38,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:38,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 19:24:39,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-16 19:24:39,152 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:39,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash -562643167, now seen corresponding path program 1 times [2025-03-16 19:24:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:39,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959422727] [2025-03-16 19:24:39,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:39,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:39,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:24:39,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:24:39,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:39,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:39,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959422727] [2025-03-16 19:24:39,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959422727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:39,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:39,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:24:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358570585] [2025-03-16 19:24:39,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:39,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:24:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:39,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:24:39,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:24:39,324 INFO L87 Difference]: Start difference. First operand 44691 states and 52926 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:24:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:39,731 INFO L93 Difference]: Finished difference Result 89313 states and 105653 transitions. [2025-03-16 19:24:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:24:39,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 19:24:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:39,906 INFO L225 Difference]: With dead ends: 89313 [2025-03-16 19:24:39,906 INFO L226 Difference]: Without dead ends: 66051 [2025-03-16 19:24:39,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:24:39,916 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 517 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:39,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 844 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66051 states. [2025-03-16 19:24:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66051 to 63665. [2025-03-16 19:24:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63665 states, 63664 states have (on average 1.184060065343051) internal successors, (75382), 63664 states have internal predecessors, (75382), 0 states have call successors, (0), 0 states 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:24:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63665 states to 63665 states and 75382 transitions. [2025-03-16 19:24:40,425 INFO L78 Accepts]: Start accepts. Automaton has 63665 states and 75382 transitions. Word has length 108 [2025-03-16 19:24:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:40,425 INFO L471 AbstractCegarLoop]: Abstraction has 63665 states and 75382 transitions. [2025-03-16 19:24:40,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:24:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 63665 states and 75382 transitions. [2025-03-16 19:24:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:24:40,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:40,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:24:40,431 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:40,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash -773138735, now seen corresponding path program 1 times [2025-03-16 19:24:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110752757] [2025-03-16 19:24:40,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:40,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:24:40,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:24:40,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:40,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:40,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:40,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110752757] [2025-03-16 19:24:40,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110752757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:40,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407913436] [2025-03-16 19:24:40,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:40,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:40,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:40,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:40,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:24:40,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:24:40,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:24:40,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:40,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:40,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 19:24:40,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:42,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:42,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407913436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:42,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:42,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 37 [2025-03-16 19:24:42,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118516196] [2025-03-16 19:24:42,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:42,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-16 19:24:42,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:42,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-16 19:24:42,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1211, Unknown=0, NotChecked=0, Total=1332 [2025-03-16 19:24:42,692 INFO L87 Difference]: Start difference. First operand 63665 states and 75382 transitions. Second operand has 37 states, 37 states have (on average 8.27027027027027) internal successors, (306), 37 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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:24:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:50,115 INFO L93 Difference]: Finished difference Result 223062 states and 265196 transitions. [2025-03-16 19:24:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2025-03-16 19:24:50,115 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 8.27027027027027) internal successors, (306), 37 states have internal predecessors, (306), 0 states have call successors, (0), 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 108 [2025-03-16 19:24:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:50,306 INFO L225 Difference]: With dead ends: 223062 [2025-03-16 19:24:50,306 INFO L226 Difference]: Without dead ends: 194792 [2025-03-16 19:24:50,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14501 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5099, Invalid=34701, Unknown=0, NotChecked=0, Total=39800 [2025-03-16 19:24:50,359 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 6081 mSDsluCounter, 6699 mSDsCounter, 0 mSdLazyCounter, 7284 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6081 SdHoareTripleChecker+Valid, 6978 SdHoareTripleChecker+Invalid, 7397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 7284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:50,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6081 Valid, 6978 Invalid, 7397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 7284 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 19:24:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194792 states. [2025-03-16 19:24:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194792 to 86379. [2025-03-16 19:24:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86379 states, 86378 states have (on average 1.1811225080460301) internal successors, (102023), 86378 states have internal predecessors, (102023), 0 states have call successors, (0), 0 states 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:24:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86379 states to 86379 states and 102023 transitions. [2025-03-16 19:24:51,514 INFO L78 Accepts]: Start accepts. Automaton has 86379 states and 102023 transitions. Word has length 108 [2025-03-16 19:24:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:51,514 INFO L471 AbstractCegarLoop]: Abstraction has 86379 states and 102023 transitions. [2025-03-16 19:24:51,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.27027027027027) internal successors, (306), 37 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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:24:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 86379 states and 102023 transitions. [2025-03-16 19:24:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:24:51,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:51,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:51,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 19:24:51,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-16 19:24:51,721 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:51,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash -157099434, now seen corresponding path program 1 times [2025-03-16 19:24:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549000188] [2025-03-16 19:24:51,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:51,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:24:51,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:24:51,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:51,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:52,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:52,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549000188] [2025-03-16 19:24:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549000188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:52,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428146380] [2025-03-16 19:24:52,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:52,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:52,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:52,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:52,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 19:24:52,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:24:52,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:24:52,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:52,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:52,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:24:52,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:53,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:24:53,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428146380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:53,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:24:53,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2025-03-16 19:24:53,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884300369] [2025-03-16 19:24:53,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:53,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:24:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:53,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:24:53,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:24:53,025 INFO L87 Difference]: Start difference. First operand 86379 states and 102023 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:24:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:53,419 INFO L93 Difference]: Finished difference Result 113595 states and 134184 transitions. [2025-03-16 19:24:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:24:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 19:24:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:53,499 INFO L225 Difference]: With dead ends: 113595 [2025-03-16 19:24:53,499 INFO L226 Difference]: Without dead ends: 81821 [2025-03-16 19:24:53,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:24:53,533 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 335 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:53,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 2263 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81821 states. [2025-03-16 19:24:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81821 to 80689. [2025-03-16 19:24:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80689 states, 80688 states have (on average 1.178043823121158) internal successors, (95054), 80688 states have internal predecessors, (95054), 0 states have call successors, (0), 0 states 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:24:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80689 states to 80689 states and 95054 transitions. [2025-03-16 19:24:54,282 INFO L78 Accepts]: Start accepts. Automaton has 80689 states and 95054 transitions. Word has length 108 [2025-03-16 19:24:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:54,283 INFO L471 AbstractCegarLoop]: Abstraction has 80689 states and 95054 transitions. [2025-03-16 19:24:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:24:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 80689 states and 95054 transitions. [2025-03-16 19:24:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:24:54,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:54,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:54,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 19:24:54,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:54,489 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:24:54,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1820608630, now seen corresponding path program 1 times [2025-03-16 19:24:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:54,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651272350] [2025-03-16 19:24:54,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:54,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:24:54,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:24:54,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:54,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:54,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:54,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651272350] [2025-03-16 19:24:54,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651272350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:54,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913614395] [2025-03-16 19:24:54,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:54,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:54,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 19:24:55,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:24:55,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:24:55,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:55,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:55,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 19:24:55,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:55,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:56,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913614395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:56,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:56,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 36 [2025-03-16 19:24:56,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702827106] [2025-03-16 19:24:56,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:56,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 19:24:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:56,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 19:24:56,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 19:24:56,630 INFO L87 Difference]: Start difference. First operand 80689 states and 95054 transitions. Second operand has 36 states, 36 states have (on average 8.777777777777779) internal successors, (316), 36 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:25:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:04,513 INFO L93 Difference]: Finished difference Result 196963 states and 232950 transitions. [2025-03-16 19:25:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2025-03-16 19:25:04,513 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.777777777777779) internal successors, (316), 36 states have internal predecessors, (316), 0 states have call successors, (0), 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 110 [2025-03-16 19:25:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:04,708 INFO L225 Difference]: With dead ends: 196963 [2025-03-16 19:25:04,708 INFO L226 Difference]: Without dead ends: 175225 [2025-03-16 19:25:04,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13553 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4630, Invalid=33982, Unknown=0, NotChecked=0, Total=38612 [2025-03-16 19:25:04,767 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 6224 mSDsluCounter, 5824 mSDsCounter, 0 mSdLazyCounter, 6725 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6224 SdHoareTripleChecker+Valid, 6191 SdHoareTripleChecker+Invalid, 6856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 6725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:04,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6224 Valid, 6191 Invalid, 6856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 6725 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 19:25:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175225 states. [2025-03-16 19:25:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175225 to 80830. [2025-03-16 19:25:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80830 states, 80829 states have (on average 1.1780672778334509) internal successors, (95222), 80829 states have internal predecessors, (95222), 0 states have call successors, (0), 0 states 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:25:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80830 states to 80830 states and 95222 transitions. [2025-03-16 19:25:05,981 INFO L78 Accepts]: Start accepts. Automaton has 80830 states and 95222 transitions. Word has length 110 [2025-03-16 19:25:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:05,982 INFO L471 AbstractCegarLoop]: Abstraction has 80830 states and 95222 transitions. [2025-03-16 19:25:05,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.777777777777779) internal successors, (316), 36 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:25:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 80830 states and 95222 transitions. [2025-03-16 19:25:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:25:05,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:05,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:05,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 19:25:06,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-16 19:25:06,189 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:25:06,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash 835490706, now seen corresponding path program 1 times [2025-03-16 19:25:06,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:06,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376024451] [2025-03-16 19:25:06,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:06,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:06,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:25:06,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:25:06,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:06,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:06,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:06,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376024451] [2025-03-16 19:25:06,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376024451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:06,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215660570] [2025-03-16 19:25:06,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:06,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:06,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:06,792 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:25:06,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 19:25:06,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:25:06,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:25:06,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:06,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:06,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 19:25:06,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:08,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215660570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:10,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2025-03-16 19:25:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437039523] [2025-03-16 19:25:10,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:10,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 19:25:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:10,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 19:25:10,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1741, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 19:25:10,081 INFO L87 Difference]: Start difference. First operand 80830 states and 95222 transitions. Second operand has 44 states, 44 states have (on average 6.363636363636363) internal successors, (280), 44 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:25:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:19,542 INFO L93 Difference]: Finished difference Result 200876 states and 236295 transitions. [2025-03-16 19:25:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-03-16 19:25:19,543 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.363636363636363) internal successors, (280), 44 states have internal predecessors, (280), 0 states have call successors, (0), 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 112 [2025-03-16 19:25:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:19,714 INFO L225 Difference]: With dead ends: 200876 [2025-03-16 19:25:19,714 INFO L226 Difference]: Without dead ends: 180861 [2025-03-16 19:25:19,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7709 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3173, Invalid=23233, Unknown=0, NotChecked=0, Total=26406 [2025-03-16 19:25:19,772 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 4372 mSDsluCounter, 15899 mSDsCounter, 0 mSdLazyCounter, 8157 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4372 SdHoareTripleChecker+Valid, 16637 SdHoareTripleChecker+Invalid, 8190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 8157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:19,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4372 Valid, 16637 Invalid, 8190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 8157 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 19:25:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180861 states. [2025-03-16 19:25:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180861 to 91334. [2025-03-16 19:25:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91334 states, 91333 states have (on average 1.1757853130850842) internal successors, (107388), 91333 states have internal predecessors, (107388), 0 states have call successors, (0), 0 states 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:25:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91334 states to 91334 states and 107388 transitions. [2025-03-16 19:25:21,061 INFO L78 Accepts]: Start accepts. Automaton has 91334 states and 107388 transitions. Word has length 112 [2025-03-16 19:25:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:21,062 INFO L471 AbstractCegarLoop]: Abstraction has 91334 states and 107388 transitions. [2025-03-16 19:25:21,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.363636363636363) internal successors, (280), 44 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:25:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 91334 states and 107388 transitions. [2025-03-16 19:25:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:25:21,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:21,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:21,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 19:25:21,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:21,268 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:25:21,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2029556813, now seen corresponding path program 1 times [2025-03-16 19:25:21,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:21,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450519690] [2025-03-16 19:25:21,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:21,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:25:21,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:25:21,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:21,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:25:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:21,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450519690] [2025-03-16 19:25:21,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450519690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:21,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:21,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:25:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312731629] [2025-03-16 19:25:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:21,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:25:21,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:21,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:25:21,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:25:21,427 INFO L87 Difference]: Start difference. First operand 91334 states and 107388 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:25:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:21,862 INFO L93 Difference]: Finished difference Result 168420 states and 197855 transitions. [2025-03-16 19:25:21,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:25:21,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 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 112 [2025-03-16 19:25:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:21,980 INFO L225 Difference]: With dead ends: 168420 [2025-03-16 19:25:21,980 INFO L226 Difference]: Without dead ends: 112881 [2025-03-16 19:25:22,023 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:25:22,023 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 635 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:22,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 639 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:25:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112881 states. [2025-03-16 19:25:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112881 to 91274. [2025-03-16 19:25:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91274 states, 91273 states have (on average 1.1758132196816145) internal successors, (107320), 91273 states have internal predecessors, (107320), 0 states have call successors, (0), 0 states 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:25:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91274 states to 91274 states and 107320 transitions. [2025-03-16 19:25:22,875 INFO L78 Accepts]: Start accepts. Automaton has 91274 states and 107320 transitions. Word has length 112 [2025-03-16 19:25:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:22,875 INFO L471 AbstractCegarLoop]: Abstraction has 91274 states and 107320 transitions. [2025-03-16 19:25:22,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:25:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 91274 states and 107320 transitions. [2025-03-16 19:25:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:25:22,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:22,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:22,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:25:22,882 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-16 19:25:22,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash -493198664, now seen corresponding path program 1 times [2025-03-16 19:25:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277667360] [2025-03-16 19:25:22,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:22,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:25:22,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:25:22,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:22,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277667360] [2025-03-16 19:25:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277667360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865143566] [2025-03-16 19:25:23,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:23,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:25:23,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 19:25:23,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:25:23,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:25:23,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:23,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:23,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 19:25:23,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:24,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865143566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:25,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 12] total 42 [2025-03-16 19:25:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756121740] [2025-03-16 19:25:25,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:25,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 19:25:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:25,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 19:25:25,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 19:25:25,582 INFO L87 Difference]: Start difference. First operand 91274 states and 107320 transitions. Second operand has 42 states, 42 states have (on average 6.9523809523809526) internal successors, (292), 42 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)