./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2218bd3b5024885ce258db0decccc6cd77d5db224efd54b84e54987ad5abfa77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:34:02,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:34:02,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:34:02,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:34:02,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:34:02,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:34:02,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:34:02,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:34:02,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:34:02,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:34:02,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:34:02,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:34:02,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:34:02,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:34:02,528 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:34:02,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:34:02,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:34:02,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:34:02,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:34:02,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:34:02,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:34:02,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:34:02,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:34:02,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:34:02,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:34:02,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:34:02,531 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2218bd3b5024885ce258db0decccc6cd77d5db224efd54b84e54987ad5abfa77 [2025-02-05 16:34:02,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:34:02,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:34:02,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:34:02,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:34:02,744 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:34:02,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:34:03,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67ac6bedf/ceb4a57ec1274131857bf44539612027/FLAGfaf660f96 [2025-02-05 16:34:04,339 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:34:04,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:34:04,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67ac6bedf/ceb4a57ec1274131857bf44539612027/FLAGfaf660f96 [2025-02-05 16:34:04,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67ac6bedf/ceb4a57ec1274131857bf44539612027 [2025-02-05 16:34:04,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:34:04,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:34:04,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:34:04,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:34:04,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:34:04,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:04,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b103a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04, skipping insertion in model container [2025-02-05 16:34:04,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:04,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:34:04,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7107,7120] [2025-02-05 16:34:04,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:34:04,819 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:34:04,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7107,7120] [2025-02-05 16:34:04,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:34:04,907 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:34:04,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04 WrapperNode [2025-02-05 16:34:04,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:34:04,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:34:04,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:34:04,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:34:04,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:04,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:04,968 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 723 [2025-02-05 16:34:04,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:34:04,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:34:04,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:34:04,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:34:04,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:04,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:04,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:05,005 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:34:05,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:05,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:05,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:05,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:05,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:05,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:05,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:34:05,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:34:05,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:34:05,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:34:05,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (1/1) ... [2025-02-05 16:34:05,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:34:05,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:34:05,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:34:05,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:34:05,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:34:05,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:34:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:34:05,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:34:05,198 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:34:05,200 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:34:05,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:05,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:05,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1113: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:05,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:05,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc main_~node2__m2~2#1; [2025-02-05 16:34:05,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:05,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: havoc main_~node3__m3~2#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L686: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~node4__m4~2#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L380: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1025: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:34:05,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:05,715 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:34:05,741 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 16:34:05,741 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:34:05,750 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:34:05,750 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:34:05,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:34:05 BoogieIcfgContainer [2025-02-05 16:34:05,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:34:05,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:34:05,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:34:05,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:34:05,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:34:04" (1/3) ... [2025-02-05 16:34:05,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767604a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:34:05, skipping insertion in model container [2025-02-05 16:34:05,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:34:04" (2/3) ... [2025-02-05 16:34:05,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767604a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:34:05, skipping insertion in model container [2025-02-05 16:34:05,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:34:05" (3/3) ... [2025-02-05 16:34:05,759 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:34:05,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:34:05,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 179 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:34:05,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:34:05,831 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;@2d8c676, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:34:05,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:34:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:34:05,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:05,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:05,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:05,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1118971602, now seen corresponding path program 1 times [2025-02-05 16:34:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:05,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379187242] [2025-02-05 16:34:05,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:05,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:34:06,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:34:06,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:06,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379187242] [2025-02-05 16:34:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379187242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:06,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:06,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41884106] [2025-02-05 16:34:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:06,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:06,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:06,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:06,384 INFO L87 Difference]: Start difference. First operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:06,606 INFO L93 Difference]: Finished difference Result 639 states and 1034 transitions. [2025-02-05 16:34:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:06,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:34:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:06,620 INFO L225 Difference]: With dead ends: 639 [2025-02-05 16:34:06,620 INFO L226 Difference]: Without dead ends: 540 [2025-02-05 16:34:06,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:06,630 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1458 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:06,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 1827 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-05 16:34:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 274. [2025-02-05 16:34:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 413 transitions. [2025-02-05 16:34:06,682 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 413 transitions. Word has length 64 [2025-02-05 16:34:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:06,684 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 413 transitions. [2025-02-05 16:34:06,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 413 transitions. [2025-02-05 16:34:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:34:06,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:06,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-02-05 16:34:06,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:34:06,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:06,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash 329342078, now seen corresponding path program 1 times [2025-02-05 16:34:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640768167] [2025-02-05 16:34:06,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:06,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:34:06,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:34:06,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:06,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:06,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:06,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640768167] [2025-02-05 16:34:06,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640768167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:06,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:06,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224103290] [2025-02-05 16:34:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:06,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:06,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:06,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:06,981 INFO L87 Difference]: Start difference. First operand 274 states and 413 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:07,089 INFO L93 Difference]: Finished difference Result 1012 states and 1565 transitions. [2025-02-05 16:34:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:07,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:34:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:07,093 INFO L225 Difference]: With dead ends: 1012 [2025-02-05 16:34:07,093 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 16:34:07,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:07,095 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1343 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:07,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 747 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 16:34:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 794. [2025-02-05 16:34:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1218 transitions. [2025-02-05 16:34:07,130 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1218 transitions. Word has length 65 [2025-02-05 16:34:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1218 transitions. [2025-02-05 16:34:07,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1218 transitions. [2025-02-05 16:34:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:34:07,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:07,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:07,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:34:07,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:07,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1214440177, now seen corresponding path program 1 times [2025-02-05 16:34:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:07,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970192648] [2025-02-05 16:34:07,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:07,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:34:07,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:34:07,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:07,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:07,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:07,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970192648] [2025-02-05 16:34:07,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970192648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:07,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:07,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833073275] [2025-02-05 16:34:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:07,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:07,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:07,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:07,369 INFO L87 Difference]: Start difference. First operand 794 states and 1218 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:07,613 INFO L93 Difference]: Finished difference Result 2016 states and 3140 transitions. [2025-02-05 16:34:07,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:07,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:34:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:07,619 INFO L225 Difference]: With dead ends: 2016 [2025-02-05 16:34:07,620 INFO L226 Difference]: Without dead ends: 1322 [2025-02-05 16:34:07,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:07,622 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 933 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:07,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 252 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-02-05 16:34:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-02-05 16:34:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5466262319939348) internal successors, (2040), 1319 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2040 transitions. [2025-02-05 16:34:07,660 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2040 transitions. Word has length 66 [2025-02-05 16:34:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:07,661 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2040 transitions. [2025-02-05 16:34:07,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2040 transitions. [2025-02-05 16:34:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:34:07,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:07,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:07,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:34:07,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:07,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 186148253, now seen corresponding path program 1 times [2025-02-05 16:34:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171632927] [2025-02-05 16:34:07,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:07,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:34:07,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:34:07,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:07,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:07,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171632927] [2025-02-05 16:34:07,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171632927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:07,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:07,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433969613] [2025-02-05 16:34:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:07,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:07,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:07,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:07,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:07,787 INFO L87 Difference]: Start difference. First operand 1320 states and 2040 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:07,963 INFO L93 Difference]: Finished difference Result 3647 states and 5687 transitions. [2025-02-05 16:34:07,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:07,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:34:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:07,971 INFO L225 Difference]: With dead ends: 3647 [2025-02-05 16:34:07,971 INFO L226 Difference]: Without dead ends: 2400 [2025-02-05 16:34:07,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:07,974 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 959 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:07,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 250 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2025-02-05 16:34:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2398. [2025-02-05 16:34:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2397 states have (on average 1.5502711722987068) internal successors, (3716), 2397 states have internal predecessors, (3716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3716 transitions. [2025-02-05 16:34:08,017 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3716 transitions. Word has length 66 [2025-02-05 16:34:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:08,017 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 3716 transitions. [2025-02-05 16:34:08,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3716 transitions. [2025-02-05 16:34:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:34:08,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:08,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:08,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:34:08,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:08,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1665879479, now seen corresponding path program 1 times [2025-02-05 16:34:08,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:08,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459445493] [2025-02-05 16:34:08,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:08,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:08,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:34:08,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:34:08,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:08,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459445493] [2025-02-05 16:34:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459445493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:08,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:08,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242256060] [2025-02-05 16:34:08,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:08,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:08,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:08,159 INFO L87 Difference]: Start difference. First operand 2398 states and 3716 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:08,367 INFO L93 Difference]: Finished difference Result 6924 states and 10788 transitions. [2025-02-05 16:34:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:34:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:08,379 INFO L225 Difference]: With dead ends: 6924 [2025-02-05 16:34:08,379 INFO L226 Difference]: Without dead ends: 4576 [2025-02-05 16:34:08,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:08,383 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 985 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:08,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 248 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-02-05 16:34:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4574. [2025-02-05 16:34:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 7081 transitions. [2025-02-05 16:34:08,454 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 7081 transitions. Word has length 66 [2025-02-05 16:34:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:08,454 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 7081 transitions. [2025-02-05 16:34:08,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 7081 transitions. [2025-02-05 16:34:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:34:08,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:08,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:08,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:34:08,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:08,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash 952289525, now seen corresponding path program 1 times [2025-02-05 16:34:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:08,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658639072] [2025-02-05 16:34:08,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:08,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:34:08,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:34:08,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:08,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658639072] [2025-02-05 16:34:08,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658639072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:08,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:08,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086327278] [2025-02-05 16:34:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:08,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:08,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:08,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:08,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:08,586 INFO L87 Difference]: Start difference. First operand 4574 states and 7081 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:08,791 INFO L93 Difference]: Finished difference Result 13472 states and 20916 transitions. [2025-02-05 16:34:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:34:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:08,816 INFO L225 Difference]: With dead ends: 13472 [2025-02-05 16:34:08,817 INFO L226 Difference]: Without dead ends: 8932 [2025-02-05 16:34:08,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:08,824 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1009 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:08,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 246 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8932 states. [2025-02-05 16:34:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8932 to 8930. [2025-02-05 16:34:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8930 states, 8929 states have (on average 1.540822040542054) internal successors, (13758), 8929 states have internal predecessors, (13758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 13758 transitions. [2025-02-05 16:34:09,054 INFO L78 Accepts]: Start accepts. Automaton has 8930 states and 13758 transitions. Word has length 66 [2025-02-05 16:34:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:09,054 INFO L471 AbstractCegarLoop]: Abstraction has 8930 states and 13758 transitions. [2025-02-05 16:34:09,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 8930 states and 13758 transitions. [2025-02-05 16:34:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:34:09,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:09,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:09,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:34:09,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:09,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash 146376352, now seen corresponding path program 1 times [2025-02-05 16:34:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168552633] [2025-02-05 16:34:09,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:09,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:34:09,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:34:09,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:09,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168552633] [2025-02-05 16:34:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168552633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:34:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294877776] [2025-02-05 16:34:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:09,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:09,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:09,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:09,454 INFO L87 Difference]: Start difference. First operand 8930 states and 13758 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:09,490 INFO L93 Difference]: Finished difference Result 9188 states and 14143 transitions. [2025-02-05 16:34:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:09,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:34:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:09,512 INFO L225 Difference]: With dead ends: 9188 [2025-02-05 16:34:09,513 INFO L226 Difference]: Without dead ends: 9186 [2025-02-05 16:34:09,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:09,516 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:09,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 970 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9186 states. [2025-02-05 16:34:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9186 to 9186. [2025-02-05 16:34:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9186 states, 9185 states have (on average 1.5257485029940119) internal successors, (14014), 9185 states have internal predecessors, (14014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9186 states to 9186 states and 14014 transitions. [2025-02-05 16:34:09,637 INFO L78 Accepts]: Start accepts. Automaton has 9186 states and 14014 transitions. Word has length 67 [2025-02-05 16:34:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:09,638 INFO L471 AbstractCegarLoop]: Abstraction has 9186 states and 14014 transitions. [2025-02-05 16:34:09,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9186 states and 14014 transitions. [2025-02-05 16:34:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:34:09,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:09,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:09,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:34:09,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:09,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash 247473648, now seen corresponding path program 1 times [2025-02-05 16:34:09,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:09,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562755669] [2025-02-05 16:34:09,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:09,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:34:09,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:34:09,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:09,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:09,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:09,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562755669] [2025-02-05 16:34:09,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562755669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:09,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:09,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:34:09,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578573726] [2025-02-05 16:34:09,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:09,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:09,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:09,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:09,934 INFO L87 Difference]: Start difference. First operand 9186 states and 14014 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:10,360 INFO L93 Difference]: Finished difference Result 11919 states and 18030 transitions. [2025-02-05 16:34:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:34:10,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:34:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:10,376 INFO L225 Difference]: With dead ends: 11919 [2025-02-05 16:34:10,376 INFO L226 Difference]: Without dead ends: 10627 [2025-02-05 16:34:10,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:34:10,381 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1123 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:10,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 755 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10627 states. [2025-02-05 16:34:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10627 to 9186. [2025-02-05 16:34:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9186 states, 9185 states have (on average 1.5256396298312467) internal successors, (14013), 9185 states have internal predecessors, (14013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9186 states to 9186 states and 14013 transitions. [2025-02-05 16:34:10,523 INFO L78 Accepts]: Start accepts. Automaton has 9186 states and 14013 transitions. Word has length 68 [2025-02-05 16:34:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:10,523 INFO L471 AbstractCegarLoop]: Abstraction has 9186 states and 14013 transitions. [2025-02-05 16:34:10,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9186 states and 14013 transitions. [2025-02-05 16:34:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:34:10,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:10,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:10,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:34:10,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:10,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:10,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2107380080, now seen corresponding path program 1 times [2025-02-05 16:34:10,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:10,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255103640] [2025-02-05 16:34:10,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:10,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:34:10,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:34:10,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:10,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:10,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255103640] [2025-02-05 16:34:10,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255103640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:10,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:10,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:34:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331861265] [2025-02-05 16:34:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:10,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:10,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:10,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:10,819 INFO L87 Difference]: Start difference. First operand 9186 states and 14013 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:11,349 INFO L93 Difference]: Finished difference Result 15691 states and 23731 transitions. [2025-02-05 16:34:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:34:11,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:34:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:11,366 INFO L225 Difference]: With dead ends: 15691 [2025-02-05 16:34:11,366 INFO L226 Difference]: Without dead ends: 12114 [2025-02-05 16:34:11,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:34:11,373 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1545 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:11,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 796 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12114 states. [2025-02-05 16:34:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12114 to 9354. [2025-02-05 16:34:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9354 states, 9353 states have (on average 1.5229338180263017) internal successors, (14244), 9353 states have internal predecessors, (14244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9354 states to 9354 states and 14244 transitions. [2025-02-05 16:34:11,534 INFO L78 Accepts]: Start accepts. Automaton has 9354 states and 14244 transitions. Word has length 68 [2025-02-05 16:34:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:11,535 INFO L471 AbstractCegarLoop]: Abstraction has 9354 states and 14244 transitions. [2025-02-05 16:34:11,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 9354 states and 14244 transitions. [2025-02-05 16:34:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:34:11,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:11,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:34:11,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash -40485648, now seen corresponding path program 1 times [2025-02-05 16:34:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318244163] [2025-02-05 16:34:11,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:11,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:34:11,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:34:11,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:11,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:11,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:11,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318244163] [2025-02-05 16:34:11,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318244163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:11,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:11,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:34:11,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942924789] [2025-02-05 16:34:11,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:11,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:11,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:11,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:11,764 INFO L87 Difference]: Start difference. First operand 9354 states and 14244 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:12,291 INFO L93 Difference]: Finished difference Result 19363 states and 29249 transitions. [2025-02-05 16:34:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:34:12,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:34:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:12,316 INFO L225 Difference]: With dead ends: 19363 [2025-02-05 16:34:12,316 INFO L226 Difference]: Without dead ends: 13523 [2025-02-05 16:34:12,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:34:12,325 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1064 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:12,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 846 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13523 states. [2025-02-05 16:34:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13523 to 9542. [2025-02-05 16:34:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9542 states, 9541 states have (on average 1.5182894874751074) internal successors, (14486), 9541 states have internal predecessors, (14486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 14486 transitions. [2025-02-05 16:34:12,458 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 14486 transitions. Word has length 68 [2025-02-05 16:34:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:12,458 INFO L471 AbstractCegarLoop]: Abstraction has 9542 states and 14486 transitions. [2025-02-05 16:34:12,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 14486 transitions. [2025-02-05 16:34:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:34:12,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:12,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:12,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:34:12,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:12,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1435412592, now seen corresponding path program 1 times [2025-02-05 16:34:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418249203] [2025-02-05 16:34:12,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:12,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:34:12,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:34:12,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:12,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418249203] [2025-02-05 16:34:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418249203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:34:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864982246] [2025-02-05 16:34:12,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:12,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:12,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:12,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:12,671 INFO L87 Difference]: Start difference. First operand 9542 states and 14486 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:13,281 INFO L93 Difference]: Finished difference Result 23505 states and 35481 transitions. [2025-02-05 16:34:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:34:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:34:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:13,313 INFO L225 Difference]: With dead ends: 23505 [2025-02-05 16:34:13,313 INFO L226 Difference]: Without dead ends: 14646 [2025-02-05 16:34:13,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:34:13,328 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 819 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:13,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 949 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:34:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14646 states. [2025-02-05 16:34:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14646 to 9676. [2025-02-05 16:34:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9676 states, 9675 states have (on average 1.5121447028423773) internal successors, (14630), 9675 states have internal predecessors, (14630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9676 states to 9676 states and 14630 transitions. [2025-02-05 16:34:13,458 INFO L78 Accepts]: Start accepts. Automaton has 9676 states and 14630 transitions. Word has length 68 [2025-02-05 16:34:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:13,459 INFO L471 AbstractCegarLoop]: Abstraction has 9676 states and 14630 transitions. [2025-02-05 16:34:13,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 9676 states and 14630 transitions. [2025-02-05 16:34:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:13,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:13,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:13,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:34:13,462 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:13,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1592237472, now seen corresponding path program 1 times [2025-02-05 16:34:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377840013] [2025-02-05 16:34:13,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:13,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:13,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:13,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:13,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:13,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377840013] [2025-02-05 16:34:13,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377840013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:13,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:13,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581213808] [2025-02-05 16:34:13,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:13,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:34:13,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:13,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:34:13,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:34:13,600 INFO L87 Difference]: Start difference. First operand 9676 states and 14630 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:13,661 INFO L93 Difference]: Finished difference Result 25520 states and 38764 transitions. [2025-02-05 16:34:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:13,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:34:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:13,690 INFO L225 Difference]: With dead ends: 25520 [2025-02-05 16:34:13,691 INFO L226 Difference]: Without dead ends: 16942 [2025-02-05 16:34:13,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:13,704 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 170 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:13,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 605 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16942 states. [2025-02-05 16:34:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16942 to 16820. [2025-02-05 16:34:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16820 states, 16819 states have (on average 1.5012783161900232) internal successors, (25250), 16819 states have internal predecessors, (25250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16820 states to 16820 states and 25250 transitions. [2025-02-05 16:34:13,934 INFO L78 Accepts]: Start accepts. Automaton has 16820 states and 25250 transitions. Word has length 69 [2025-02-05 16:34:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:13,934 INFO L471 AbstractCegarLoop]: Abstraction has 16820 states and 25250 transitions. [2025-02-05 16:34:13,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 16820 states and 25250 transitions. [2025-02-05 16:34:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:13,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:13,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:13,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:34:13,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:13,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash 800567042, now seen corresponding path program 1 times [2025-02-05 16:34:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087244372] [2025-02-05 16:34:13,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:13,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:13,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:13,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:13,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087244372] [2025-02-05 16:34:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087244372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:13,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074482035] [2025-02-05 16:34:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:13,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:13,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:13,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:13,983 INFO L87 Difference]: Start difference. First operand 16820 states and 25250 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-02-05 16:34:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:14,063 INFO L93 Difference]: Finished difference Result 41238 states and 62109 transitions. [2025-02-05 16:34:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:14,063 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-02-05 16:34:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:14,099 INFO L225 Difference]: With dead ends: 41238 [2025-02-05 16:34:14,100 INFO L226 Difference]: Without dead ends: 27946 [2025-02-05 16:34:14,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:14,119 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 176 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:14,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 468 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27946 states. [2025-02-05 16:34:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27946 to 27896. [2025-02-05 16:34:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27896 states, 27895 states have (on average 1.4951066499372647) internal successors, (41706), 27895 states have internal predecessors, (41706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27896 states to 27896 states and 41706 transitions. [2025-02-05 16:34:14,563 INFO L78 Accepts]: Start accepts. Automaton has 27896 states and 41706 transitions. Word has length 69 [2025-02-05 16:34:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:14,564 INFO L471 AbstractCegarLoop]: Abstraction has 27896 states and 41706 transitions. [2025-02-05 16:34:14,564 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-02-05 16:34:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 27896 states and 41706 transitions. [2025-02-05 16:34:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:14,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:14,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:34:14,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:14,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1759014655, now seen corresponding path program 1 times [2025-02-05 16:34:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357234202] [2025-02-05 16:34:14,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:14,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:14,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:14,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:14,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357234202] [2025-02-05 16:34:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357234202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011298298] [2025-02-05 16:34:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:14,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:14,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:14,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:14,620 INFO L87 Difference]: Start difference. First operand 27896 states and 41706 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-02-05 16:34:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:14,857 INFO L93 Difference]: Finished difference Result 39969 states and 59633 transitions. [2025-02-05 16:34:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:14,858 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-02-05 16:34:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:14,898 INFO L225 Difference]: With dead ends: 39969 [2025-02-05 16:34:14,899 INFO L226 Difference]: Without dead ends: 31009 [2025-02-05 16:34:14,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:14,910 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 145 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:14,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 558 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31009 states. [2025-02-05 16:34:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31009 to 27147. [2025-02-05 16:34:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27147 states, 27146 states have (on average 1.4692772415825537) internal successors, (39885), 27146 states have internal predecessors, (39885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27147 states to 27147 states and 39885 transitions. [2025-02-05 16:34:15,263 INFO L78 Accepts]: Start accepts. Automaton has 27147 states and 39885 transitions. Word has length 69 [2025-02-05 16:34:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:15,264 INFO L471 AbstractCegarLoop]: Abstraction has 27147 states and 39885 transitions. [2025-02-05 16:34:15,264 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-02-05 16:34:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 27147 states and 39885 transitions. [2025-02-05 16:34:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:15,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:15,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:15,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:34:15,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:15,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:15,268 INFO L85 PathProgramCache]: Analyzing trace with hash 706108514, now seen corresponding path program 1 times [2025-02-05 16:34:15,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349786466] [2025-02-05 16:34:15,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:15,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:15,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:15,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:15,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349786466] [2025-02-05 16:34:15,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349786466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:15,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:15,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:15,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109311407] [2025-02-05 16:34:15,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:15,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:15,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:15,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:15,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:15,311 INFO L87 Difference]: Start difference. First operand 27147 states and 39885 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-02-05 16:34:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:15,533 INFO L93 Difference]: Finished difference Result 47201 states and 69424 transitions. [2025-02-05 16:34:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:15,533 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-02-05 16:34:15,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:15,577 INFO L225 Difference]: With dead ends: 47201 [2025-02-05 16:34:15,577 INFO L226 Difference]: Without dead ends: 31261 [2025-02-05 16:34:15,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:15,596 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 155 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:15,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 500 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31261 states. [2025-02-05 16:34:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31261 to 30847. [2025-02-05 16:34:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30847 states, 30846 states have (on average 1.4431692926149258) internal successors, (44516), 30846 states have internal predecessors, (44516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30847 states to 30847 states and 44516 transitions. [2025-02-05 16:34:16,080 INFO L78 Accepts]: Start accepts. Automaton has 30847 states and 44516 transitions. Word has length 69 [2025-02-05 16:34:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:16,080 INFO L471 AbstractCegarLoop]: Abstraction has 30847 states and 44516 transitions. [2025-02-05 16:34:16,080 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-02-05 16:34:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30847 states and 44516 transitions. [2025-02-05 16:34:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:34:16,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:16,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:34:16,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 871916129, now seen corresponding path program 1 times [2025-02-05 16:34:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823932612] [2025-02-05 16:34:16,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:16,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:34:16,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:34:16,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:16,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823932612] [2025-02-05 16:34:16,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823932612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:16,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:16,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:16,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042130439] [2025-02-05 16:34:16,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:16,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:16,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:16,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:16,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:16,130 INFO L87 Difference]: Start difference. First operand 30847 states and 44516 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-02-05 16:34:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:16,261 INFO L93 Difference]: Finished difference Result 60636 states and 87270 transitions. [2025-02-05 16:34:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:16,262 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-02-05 16:34:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:16,309 INFO L225 Difference]: With dead ends: 60636 [2025-02-05 16:34:16,310 INFO L226 Difference]: Without dead ends: 33744 [2025-02-05 16:34:16,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:16,336 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 165 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:16,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 465 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33744 states. [2025-02-05 16:34:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33744 to 33426. [2025-02-05 16:34:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33426 states, 33425 states have (on average 1.4062228870605833) internal successors, (47003), 33425 states have internal predecessors, (47003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 47003 transitions. [2025-02-05 16:34:17,193 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 47003 transitions. Word has length 69 [2025-02-05 16:34:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:17,193 INFO L471 AbstractCegarLoop]: Abstraction has 33426 states and 47003 transitions. [2025-02-05 16:34:17,193 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-02-05 16:34:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 47003 transitions. [2025-02-05 16:34:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:34:17,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:17,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:17,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:34:17,196 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:17,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash -548566319, now seen corresponding path program 1 times [2025-02-05 16:34:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:17,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535629782] [2025-02-05 16:34:17,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:17,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:34:17,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:34:17,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:17,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:17,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535629782] [2025-02-05 16:34:17,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535629782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:17,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:17,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746241189] [2025-02-05 16:34:17,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:17,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:17,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:17,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:17,355 INFO L87 Difference]: Start difference. First operand 33426 states and 47003 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:17,855 INFO L93 Difference]: Finished difference Result 60564 states and 85857 transitions. [2025-02-05 16:34:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:34:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:17,930 INFO L225 Difference]: With dead ends: 60564 [2025-02-05 16:34:17,931 INFO L226 Difference]: Without dead ends: 56575 [2025-02-05 16:34:17,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:17,953 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1117 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:17,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1133 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56575 states. [2025-02-05 16:34:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56575 to 37353. [2025-02-05 16:34:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37353 states, 37352 states have (on average 1.4067252088241593) internal successors, (52544), 37352 states have internal predecessors, (52544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37353 states to 37353 states and 52544 transitions. [2025-02-05 16:34:18,665 INFO L78 Accepts]: Start accepts. Automaton has 37353 states and 52544 transitions. Word has length 70 [2025-02-05 16:34:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 37353 states and 52544 transitions. [2025-02-05 16:34:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 37353 states and 52544 transitions. [2025-02-05 16:34:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:34:18,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:18,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:18,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:34:18,668 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:18,668 INFO L85 PathProgramCache]: Analyzing trace with hash -271879983, now seen corresponding path program 1 times [2025-02-05 16:34:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840941622] [2025-02-05 16:34:18,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:18,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:18,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:34:18,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:34:18,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:18,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:18,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840941622] [2025-02-05 16:34:18,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840941622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:18,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:18,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:18,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611394849] [2025-02-05 16:34:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:18,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:18,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:18,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:18,746 INFO L87 Difference]: Start difference. First operand 37353 states and 52544 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:18,940 INFO L93 Difference]: Finished difference Result 69226 states and 98157 transitions. [2025-02-05 16:34:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:18,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:34:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:19,019 INFO L225 Difference]: With dead ends: 69226 [2025-02-05 16:34:19,019 INFO L226 Difference]: Without dead ends: 60401 [2025-02-05 16:34:19,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:19,045 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 1041 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:19,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1197 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60401 states. [2025-02-05 16:34:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60401 to 46064. [2025-02-05 16:34:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46064 states, 46063 states have (on average 1.406877537285891) internal successors, (64805), 46063 states have internal predecessors, (64805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46064 states to 46064 states and 64805 transitions. [2025-02-05 16:34:19,966 INFO L78 Accepts]: Start accepts. Automaton has 46064 states and 64805 transitions. Word has length 70 [2025-02-05 16:34:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:19,967 INFO L471 AbstractCegarLoop]: Abstraction has 46064 states and 64805 transitions. [2025-02-05 16:34:19,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 46064 states and 64805 transitions. [2025-02-05 16:34:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:34:19,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:19,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:19,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:34:19,969 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:19,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:19,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1385153455, now seen corresponding path program 1 times [2025-02-05 16:34:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:19,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650392209] [2025-02-05 16:34:19,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:19,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:34:19,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:34:19,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:19,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:20,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-02-05 16:34:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650392209] [2025-02-05 16:34:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650392209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:20,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471624527] [2025-02-05 16:34:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:20,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:20,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:20,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:20,053 INFO L87 Difference]: Start difference. First operand 46064 states and 64805 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:20,264 INFO L93 Difference]: Finished difference Result 82473 states and 116912 transitions. [2025-02-05 16:34:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:20,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:34:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:20,343 INFO L225 Difference]: With dead ends: 82473 [2025-02-05 16:34:20,343 INFO L226 Difference]: Without dead ends: 69004 [2025-02-05 16:34:20,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:20,375 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1085 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:20,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1303 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69004 states. [2025-02-05 16:34:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69004 to 55126. [2025-02-05 16:34:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55126 states, 55125 states have (on average 1.409015873015873) internal successors, (77672), 55125 states have internal predecessors, (77672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55126 states to 55126 states and 77672 transitions. [2025-02-05 16:34:21,320 INFO L78 Accepts]: Start accepts. Automaton has 55126 states and 77672 transitions. Word has length 70 [2025-02-05 16:34:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:21,321 INFO L471 AbstractCegarLoop]: Abstraction has 55126 states and 77672 transitions. [2025-02-05 16:34:21,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 55126 states and 77672 transitions. [2025-02-05 16:34:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:34:21,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34: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, 1] [2025-02-05 16:34:21,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:34:21,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:21,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2089966831, now seen corresponding path program 1 times [2025-02-05 16:34:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033278679] [2025-02-05 16:34:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:21,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:34:21,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:34:21,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:21,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:21,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:21,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033278679] [2025-02-05 16:34:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033278679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:21,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:21,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:21,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009357179] [2025-02-05 16:34:21,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:21,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:21,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:21,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:21,420 INFO L87 Difference]: Start difference. First operand 55126 states and 77672 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:21,855 INFO L93 Difference]: Finished difference Result 91888 states and 130212 transitions. [2025-02-05 16:34:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:34:21,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:21,955 INFO L225 Difference]: With dead ends: 91888 [2025-02-05 16:34:21,955 INFO L226 Difference]: Without dead ends: 79192 [2025-02-05 16:34:21,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:21,983 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1096 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:21,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 1149 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79192 states. [2025-02-05 16:34:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79192 to 61427. [2025-02-05 16:34:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61427 states, 61426 states have (on average 1.4104613681502947) internal successors, (86639), 61426 states have internal predecessors, (86639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61427 states to 61427 states and 86639 transitions. [2025-02-05 16:34:22,828 INFO L78 Accepts]: Start accepts. Automaton has 61427 states and 86639 transitions. Word has length 70 [2025-02-05 16:34:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:22,829 INFO L471 AbstractCegarLoop]: Abstraction has 61427 states and 86639 transitions. [2025-02-05 16:34:22,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 61427 states and 86639 transitions. [2025-02-05 16:34:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:34:22,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:22,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:22,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:34:22,833 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 646420641, now seen corresponding path program 1 times [2025-02-05 16:34:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:22,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429216025] [2025-02-05 16:34:22,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:22,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:34:22,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:34:22,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:22,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429216025] [2025-02-05 16:34:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429216025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:22,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920222514] [2025-02-05 16:34:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:22,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:22,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:22,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:22,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:22,924 INFO L87 Difference]: Start difference. First operand 61427 states and 86639 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:23,782 INFO L93 Difference]: Finished difference Result 182189 states and 254647 transitions. [2025-02-05 16:34:23,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:23,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:34:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:24,001 INFO L225 Difference]: With dead ends: 182189 [2025-02-05 16:34:24,002 INFO L226 Difference]: Without dead ends: 159754 [2025-02-05 16:34:24,037 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-02-05 16:34:24,038 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1615 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:24,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1615 Valid, 457 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:34:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2025-02-05 16:34:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 61609. [2025-02-05 16:34:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61609 states, 61608 states have (on average 1.4098006752369823) internal successors, (86855), 61608 states have internal predecessors, (86855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61609 states to 61609 states and 86855 transitions. [2025-02-05 16:34:25,506 INFO L78 Accepts]: Start accepts. Automaton has 61609 states and 86855 transitions. Word has length 75 [2025-02-05 16:34:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:25,507 INFO L471 AbstractCegarLoop]: Abstraction has 61609 states and 86855 transitions. [2025-02-05 16:34:25,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 61609 states and 86855 transitions. [2025-02-05 16:34:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:34:25,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:25,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:25,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:34:25,515 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1669357284, now seen corresponding path program 1 times [2025-02-05 16:34:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565604792] [2025-02-05 16:34:25,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:25,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:34:25,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:34:25,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:25,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:25,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:25,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565604792] [2025-02-05 16:34:25,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565604792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:25,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:25,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671939446] [2025-02-05 16:34:25,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:25,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:25,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:25,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:25,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:25,695 INFO L87 Difference]: Start difference. First operand 61609 states and 86855 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:26,595 INFO L93 Difference]: Finished difference Result 182896 states and 256818 transitions. [2025-02-05 16:34:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:26,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:34:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:26,812 INFO L225 Difference]: With dead ends: 182896 [2025-02-05 16:34:26,813 INFO L226 Difference]: Without dead ends: 160438 [2025-02-05 16:34:26,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:26,880 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1773 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1773 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:26,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1773 Valid, 470 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:34:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160438 states. [2025-02-05 16:34:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160438 to 61713. [2025-02-05 16:34:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61713 states, 61712 states have (on average 1.4094503500129634) internal successors, (86980), 61712 states have internal predecessors, (86980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61713 states to 61713 states and 86980 transitions. [2025-02-05 16:34:28,446 INFO L78 Accepts]: Start accepts. Automaton has 61713 states and 86980 transitions. Word has length 75 [2025-02-05 16:34:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:28,447 INFO L471 AbstractCegarLoop]: Abstraction has 61713 states and 86980 transitions. [2025-02-05 16:34:28,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 61713 states and 86980 transitions. [2025-02-05 16:34:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:34:28,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:28,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:28,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:34:28,452 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:28,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1099371106, now seen corresponding path program 1 times [2025-02-05 16:34:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:28,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313510882] [2025-02-05 16:34:28,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:28,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:28,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:34:28,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:34:28,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:28,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:28,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313510882] [2025-02-05 16:34:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313510882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:28,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:28,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666334654] [2025-02-05 16:34:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:28,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:28,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:28,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:28,527 INFO L87 Difference]: Start difference. First operand 61713 states and 86980 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:29,133 INFO L93 Difference]: Finished difference Result 145319 states and 202582 transitions. [2025-02-05 16:34:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:34:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:29,297 INFO L225 Difference]: With dead ends: 145319 [2025-02-05 16:34:29,297 INFO L226 Difference]: Without dead ends: 133558 [2025-02-05 16:34:29,346 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-02-05 16:34:29,347 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1401 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1401 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:29,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1401 Valid, 449 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133558 states. [2025-02-05 16:34:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133558 to 62011. [2025-02-05 16:34:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62011 states, 62010 states have (on average 1.4082728592162554) internal successors, (87327), 62010 states have internal predecessors, (87327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62011 states to 62011 states and 87327 transitions. [2025-02-05 16:34:31,221 INFO L78 Accepts]: Start accepts. Automaton has 62011 states and 87327 transitions. Word has length 75 [2025-02-05 16:34:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:31,222 INFO L471 AbstractCegarLoop]: Abstraction has 62011 states and 87327 transitions. [2025-02-05 16:34:31,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 62011 states and 87327 transitions. [2025-02-05 16:34:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:34:31,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:31,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:31,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:34:31,228 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:31,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash 152121571, now seen corresponding path program 1 times [2025-02-05 16:34:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:31,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676824671] [2025-02-05 16:34:31,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:31,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:34:31,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:34:31,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:31,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676824671] [2025-02-05 16:34:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676824671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:31,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464863247] [2025-02-05 16:34:31,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:31,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:31,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:31,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:31,728 INFO L87 Difference]: Start difference. First operand 62011 states and 87327 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:32,268 INFO L93 Difference]: Finished difference Result 150187 states and 210310 transitions. [2025-02-05 16:34:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:34:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:32,426 INFO L225 Difference]: With dead ends: 150187 [2025-02-05 16:34:32,426 INFO L226 Difference]: Without dead ends: 116515 [2025-02-05 16:34:32,481 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-02-05 16:34:32,481 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1236 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:32,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 403 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116515 states. [2025-02-05 16:34:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116515 to 62061. [2025-02-05 16:34:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62061 states, 62060 states have (on average 1.4081050596197229) internal successors, (87387), 62060 states have internal predecessors, (87387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62061 states to 62061 states and 87387 transitions. [2025-02-05 16:34:33,553 INFO L78 Accepts]: Start accepts. Automaton has 62061 states and 87387 transitions. Word has length 75 [2025-02-05 16:34:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:33,554 INFO L471 AbstractCegarLoop]: Abstraction has 62061 states and 87387 transitions. [2025-02-05 16:34:33,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 62061 states and 87387 transitions. [2025-02-05 16:34:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:34:33,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:33,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:33,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:34:33,559 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:33,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash -463025853, now seen corresponding path program 1 times [2025-02-05 16:34:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:33,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088875109] [2025-02-05 16:34:33,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:33,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:34:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:34:33,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:33,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:34,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:34,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088875109] [2025-02-05 16:34:34,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088875109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:34,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:34,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:34:34,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929574154] [2025-02-05 16:34:34,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:34,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:34:34,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:34,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:34:34,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:34:34,298 INFO L87 Difference]: Start difference. First operand 62061 states and 87387 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:35,265 INFO L93 Difference]: Finished difference Result 113949 states and 160435 transitions. [2025-02-05 16:34:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:34:35,265 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:34:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:35,392 INFO L225 Difference]: With dead ends: 113949 [2025-02-05 16:34:35,392 INFO L226 Difference]: Without dead ends: 106020 [2025-02-05 16:34:35,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:34:35,432 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1354 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:35,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 2204 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106020 states. [2025-02-05 16:34:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106020 to 62077. [2025-02-05 16:34:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62077 states, 62076 states have (on average 1.4078387782717958) internal successors, (87393), 62076 states have internal predecessors, (87393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62077 states to 62077 states and 87393 transitions. [2025-02-05 16:34:36,519 INFO L78 Accepts]: Start accepts. Automaton has 62077 states and 87393 transitions. Word has length 77 [2025-02-05 16:34:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:36,519 INFO L471 AbstractCegarLoop]: Abstraction has 62077 states and 87393 transitions. [2025-02-05 16:34:36,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 62077 states and 87393 transitions. [2025-02-05 16:34:36,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:34:36,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:36,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:36,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:34:36,525 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:36,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1194915973, now seen corresponding path program 1 times [2025-02-05 16:34:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395376454] [2025-02-05 16:34:36,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:36,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:36,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:34:36,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:34:36,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:36,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395376454] [2025-02-05 16:34:37,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395376454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:37,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:37,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:34:37,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299736095] [2025-02-05 16:34:37,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:37,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:34:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:37,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:34:37,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:34:37,087 INFO L87 Difference]: Start difference. First operand 62077 states and 87393 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:38,060 INFO L93 Difference]: Finished difference Result 123265 states and 173573 transitions. [2025-02-05 16:34:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:34:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:34:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:38,171 INFO L225 Difference]: With dead ends: 123265 [2025-02-05 16:34:38,171 INFO L226 Difference]: Without dead ends: 97419 [2025-02-05 16:34:38,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:34:38,216 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1539 mSDsluCounter, 2147 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:38,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 2470 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:34:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97419 states. [2025-02-05 16:34:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97419 to 61907. [2025-02-05 16:34:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61907 states, 61906 states have (on average 1.4082964494556263) internal successors, (87182), 61906 states have internal predecessors, (87182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61907 states to 61907 states and 87182 transitions. [2025-02-05 16:34:39,195 INFO L78 Accepts]: Start accepts. Automaton has 61907 states and 87182 transitions. Word has length 77 [2025-02-05 16:34:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:39,195 INFO L471 AbstractCegarLoop]: Abstraction has 61907 states and 87182 transitions. [2025-02-05 16:34:39,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 61907 states and 87182 transitions. [2025-02-05 16:34:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:34:39,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:39,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:39,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:34:39,202 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:39,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash -164434357, now seen corresponding path program 1 times [2025-02-05 16:34:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471484532] [2025-02-05 16:34:39,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:39,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:34:39,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:34:39,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:39,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:39,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:39,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471484532] [2025-02-05 16:34:39,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471484532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:39,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:39,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:39,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472344487] [2025-02-05 16:34:39,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:39,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:39,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:39,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:39,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:39,267 INFO L87 Difference]: Start difference. First operand 61907 states and 87182 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:39,527 INFO L93 Difference]: Finished difference Result 113440 states and 159537 transitions. [2025-02-05 16:34:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:39,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:34:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:39,635 INFO L225 Difference]: With dead ends: 113440 [2025-02-05 16:34:39,635 INFO L226 Difference]: Without dead ends: 85348 [2025-02-05 16:34:39,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:39,678 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 196 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:39,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 395 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85348 states. [2025-02-05 16:34:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85348 to 85202. [2025-02-05 16:34:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85202 states, 85201 states have (on average 1.4071431086489594) internal successors, (119890), 85201 states have internal predecessors, (119890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85202 states to 85202 states and 119890 transitions. [2025-02-05 16:34:40,990 INFO L78 Accepts]: Start accepts. Automaton has 85202 states and 119890 transitions. Word has length 78 [2025-02-05 16:34:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:40,990 INFO L471 AbstractCegarLoop]: Abstraction has 85202 states and 119890 transitions. [2025-02-05 16:34:40,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 85202 states and 119890 transitions. [2025-02-05 16:34:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:34:40,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:40,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:40,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:34:40,996 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:40,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1552857261, now seen corresponding path program 1 times [2025-02-05 16:34:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197398482] [2025-02-05 16:34:40,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:41,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:34:41,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:34:41,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:41,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:41,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197398482] [2025-02-05 16:34:41,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197398482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:41,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:41,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272883877] [2025-02-05 16:34:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:41,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:41,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:41,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:41,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:41,051 INFO L87 Difference]: Start difference. First operand 85202 states and 119890 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:42,133 INFO L93 Difference]: Finished difference Result 181413 states and 255323 transitions. [2025-02-05 16:34:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:34:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:42,263 INFO L225 Difference]: With dead ends: 181413 [2025-02-05 16:34:42,264 INFO L226 Difference]: Without dead ends: 124089 [2025-02-05 16:34:42,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:42,305 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 185 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:42,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 364 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124089 states. [2025-02-05 16:34:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124089 to 123647. [2025-02-05 16:34:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123647 states, 123646 states have (on average 1.4098798181906411) internal successors, (174326), 123646 states have internal predecessors, (174326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123647 states to 123647 states and 174326 transitions. [2025-02-05 16:34:44,030 INFO L78 Accepts]: Start accepts. Automaton has 123647 states and 174326 transitions. Word has length 78 [2025-02-05 16:34:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:44,030 INFO L471 AbstractCegarLoop]: Abstraction has 123647 states and 174326 transitions. [2025-02-05 16:34:44,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 123647 states and 174326 transitions. [2025-02-05 16:34:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:34:44,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:44,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:44,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:34:44,040 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 224140727, now seen corresponding path program 1 times [2025-02-05 16:34:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314669810] [2025-02-05 16:34:44,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:44,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:34:44,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:34:44,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:44,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314669810] [2025-02-05 16:34:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314669810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:44,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:44,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062020586] [2025-02-05 16:34:44,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:44,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:44,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:44,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:44,092 INFO L87 Difference]: Start difference. First operand 123647 states and 174326 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:45,435 INFO L93 Difference]: Finished difference Result 245525 states and 346635 transitions. [2025-02-05 16:34:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:34:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:45,681 INFO L225 Difference]: With dead ends: 245525 [2025-02-05 16:34:45,681 INFO L226 Difference]: Without dead ends: 164830 [2025-02-05 16:34:45,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:45,769 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 172 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:45,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 362 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164830 states. [2025-02-05 16:34:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164830 to 107837. [2025-02-05 16:34:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107837 states, 107836 states have (on average 1.4140454022775326) internal successors, (152485), 107836 states have internal predecessors, (152485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107837 states to 107837 states and 152485 transitions. [2025-02-05 16:34:48,228 INFO L78 Accepts]: Start accepts. Automaton has 107837 states and 152485 transitions. Word has length 81 [2025-02-05 16:34:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:48,228 INFO L471 AbstractCegarLoop]: Abstraction has 107837 states and 152485 transitions. [2025-02-05 16:34:48,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 107837 states and 152485 transitions. [2025-02-05 16:34:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:34:48,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:48,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:48,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:34:48,236 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:48,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash 310655262, now seen corresponding path program 1 times [2025-02-05 16:34:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:48,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931498659] [2025-02-05 16:34:48,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:48,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:48,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:34:48,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:34:48,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:48,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931498659] [2025-02-05 16:34:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931498659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:48,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:48,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237531262] [2025-02-05 16:34:48,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:48,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:48,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:48,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:48,310 INFO L87 Difference]: Start difference. First operand 107837 states and 152485 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:48,718 INFO L93 Difference]: Finished difference Result 157007 states and 221478 transitions. [2025-02-05 16:34:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:34:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:48,837 INFO L225 Difference]: With dead ends: 157007 [2025-02-05 16:34:48,837 INFO L226 Difference]: Without dead ends: 93764 [2025-02-05 16:34:48,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:48,897 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 148 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:48,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 581 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93764 states. [2025-02-05 16:34:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93764 to 93762. [2025-02-05 16:34:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93762 states, 93761 states have (on average 1.3981932786553044) internal successors, (131096), 93761 states have internal predecessors, (131096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93762 states to 93762 states and 131096 transitions. [2025-02-05 16:34:50,420 INFO L78 Accepts]: Start accepts. Automaton has 93762 states and 131096 transitions. Word has length 81 [2025-02-05 16:34:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:50,420 INFO L471 AbstractCegarLoop]: Abstraction has 93762 states and 131096 transitions. [2025-02-05 16:34:50,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 93762 states and 131096 transitions. [2025-02-05 16:34:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:34:50,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:50,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:50,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:34:50,428 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:50,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1935995021, now seen corresponding path program 1 times [2025-02-05 16:34:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:50,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845841880] [2025-02-05 16:34:50,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:50,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:34:50,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:34:50,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:50,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:50,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:50,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845841880] [2025-02-05 16:34:50,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845841880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:50,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:50,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795594812] [2025-02-05 16:34:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:50,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:50,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:50,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:50,474 INFO L87 Difference]: Start difference. First operand 93762 states and 131096 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:51,408 INFO L93 Difference]: Finished difference Result 185199 states and 259213 transitions. [2025-02-05 16:34:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:51,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:34:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:51,577 INFO L225 Difference]: With dead ends: 185199 [2025-02-05 16:34:51,577 INFO L226 Difference]: Without dead ends: 129862 [2025-02-05 16:34:51,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:51,609 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 181 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:51,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 367 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129862 states. [2025-02-05 16:34:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129862 to 91392. [2025-02-05 16:34:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91392 states, 91391 states have (on average 1.396516068321826) internal successors, (127629), 91391 states have internal predecessors, (127629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91392 states to 91392 states and 127629 transitions. [2025-02-05 16:34:52,910 INFO L78 Accepts]: Start accepts. Automaton has 91392 states and 127629 transitions. Word has length 82 [2025-02-05 16:34:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:52,910 INFO L471 AbstractCegarLoop]: Abstraction has 91392 states and 127629 transitions. [2025-02-05 16:34:52,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 91392 states and 127629 transitions. [2025-02-05 16:34:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:34:52,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:52,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:52,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:34:52,914 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:52,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash -327572470, now seen corresponding path program 1 times [2025-02-05 16:34:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643840705] [2025-02-05 16:34:52,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:52,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:52,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:34:52,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:34:52,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:52,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:53,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:53,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643840705] [2025-02-05 16:34:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643840705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:34:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426959448] [2025-02-05 16:34:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:53,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:34:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:53,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:34:53,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:34:53,296 INFO L87 Difference]: Start difference. First operand 91392 states and 127629 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)