./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 379867ea0961f41e6474fa8c55575cf4bd65e7485349e160061a341c7749e45b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:15:52,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:15:52,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:15:52,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:15:52,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:15:52,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:15:52,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:15:52,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:15:52,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:15:52,433 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:15:52,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:15:52,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:15:52,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:15:52,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:15:52,434 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:15:52,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:15:52,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:15:52,434 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:15:52,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:15:52,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:15:52,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:15:52,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:15:52,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:15:52,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:15:52,436 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 379867ea0961f41e6474fa8c55575cf4bd65e7485349e160061a341c7749e45b [2025-03-08 06:15:52,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:15:52,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:15:52,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:15:52,669 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:15:52,669 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:15:52,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-08 06:15:53,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283df71ca/dbc98132f2c14bdc91f87c98655f1d5b/FLAGc7dd38d64 [2025-03-08 06:15:54,165 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:15:54,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-08 06:15:54,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283df71ca/dbc98132f2c14bdc91f87c98655f1d5b/FLAGc7dd38d64 [2025-03-08 06:15:54,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283df71ca/dbc98132f2c14bdc91f87c98655f1d5b [2025-03-08 06:15:54,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:15:54,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:15:54,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:15:54,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:15:54,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:15:54,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d912b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54, skipping insertion in model container [2025-03-08 06:15:54,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:15:54,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2025-03-08 06:15:54,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:15:54,479 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:15:54,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2025-03-08 06:15:54,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:15:54,572 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:15:54,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54 WrapperNode [2025-03-08 06:15:54,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:15:54,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:15:54,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:15:54,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:15:54,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,608 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 668 [2025-03-08 06:15:54,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:15:54,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:15:54,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:15:54,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:15:54,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,635 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:15:54,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:15:54,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:15:54,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:15:54,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:15:54,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (1/1) ... [2025-03-08 06:15:54,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:15:54,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:15:54,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:15:54,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:15:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:15:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:15:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:15:54,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:15:54,795 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:15:54,797 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node2__m2~2#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L599: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L352: havoc main_~node3__m3~2#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L772: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-08 06:15:55,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L657: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:15:55,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:15:55,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:15:55,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-08 06:15:55,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L992: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-08 06:15:55,388 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-08 06:15:55,388 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:15:55,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:15:55,405 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:15:55,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:15:55 BoogieIcfgContainer [2025-03-08 06:15:55,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:15:55,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:15:55,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:15:55,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:15:55,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:15:54" (1/3) ... [2025-03-08 06:15:55,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4565868d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:15:55, skipping insertion in model container [2025-03-08 06:15:55,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:54" (2/3) ... [2025-03-08 06:15:55,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4565868d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:15:55, skipping insertion in model container [2025-03-08 06:15:55,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:15:55" (3/3) ... [2025-03-08 06:15:55,413 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-08 06:15:55,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:15:55,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 162 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:15:55,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:15:55,479 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;@1ac82545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:15:55,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:15:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:15:55,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:55,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:55,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:55,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1491072562, now seen corresponding path program 1 times [2025-03-08 06:15:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635913012] [2025-03-08 06:15:55,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:55,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:15:55,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:15:55,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:55,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:55,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635913012] [2025-03-08 06:15:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635913012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:55,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:55,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:15:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957218211] [2025-03-08 06:15:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:15:55,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:55,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:15:55,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:55,904 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:56,087 INFO L93 Difference]: Finished difference Result 517 states and 836 transitions. [2025-03-08 06:15:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:15:56,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 06:15:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:56,106 INFO L225 Difference]: With dead ends: 517 [2025-03-08 06:15:56,106 INFO L226 Difference]: Without dead ends: 438 [2025-03-08 06:15:56,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:56,112 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 913 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:56,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1288 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-08 06:15:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 256. [2025-03-08 06:15:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2025-03-08 06:15:56,162 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 50 [2025-03-08 06:15:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:56,162 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2025-03-08 06:15:56,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2025-03-08 06:15:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:15:56,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:56,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:56,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:15:56,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:56,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -437478874, now seen corresponding path program 1 times [2025-03-08 06:15:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726157839] [2025-03-08 06:15:56,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:56,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:15:56,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:15:56,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:56,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:56,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-03-08 06:15:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726157839] [2025-03-08 06:15:56,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726157839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:56,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279260777] [2025-03-08 06:15:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:56,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:56,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:56,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:56,311 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:56,346 INFO L93 Difference]: Finished difference Result 628 states and 954 transitions. [2025-03-08 06:15:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:56,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 06:15:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:56,348 INFO L225 Difference]: With dead ends: 628 [2025-03-08 06:15:56,348 INFO L226 Difference]: Without dead ends: 430 [2025-03-08 06:15:56,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:56,349 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 158 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:56,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:15:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-08 06:15:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2025-03-08 06:15:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2025-03-08 06:15:56,374 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 53 [2025-03-08 06:15:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:56,374 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2025-03-08 06:15:56,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2025-03-08 06:15:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:15:56,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:56,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:56,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:15:56,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:56,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash 755976069, now seen corresponding path program 1 times [2025-03-08 06:15:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590759799] [2025-03-08 06:15:56,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:56,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:56,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:15:56,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:15:56,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:56,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:56,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:56,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590759799] [2025-03-08 06:15:56,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590759799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:56,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:56,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898670139] [2025-03-08 06:15:56,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:56,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:56,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:56,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:56,487 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:56,511 INFO L93 Difference]: Finished difference Result 1078 states and 1615 transitions. [2025-03-08 06:15:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:56,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 06:15:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:56,514 INFO L225 Difference]: With dead ends: 1078 [2025-03-08 06:15:56,514 INFO L226 Difference]: Without dead ends: 750 [2025-03-08 06:15:56,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:56,516 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 157 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 434 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-03-08 06:15:56,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:15:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-08 06:15:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2025-03-08 06:15:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1100 transitions. [2025-03-08 06:15:56,531 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1100 transitions. Word has length 53 [2025-03-08 06:15:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:56,531 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1100 transitions. [2025-03-08 06:15:56,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1100 transitions. [2025-03-08 06:15:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:15:56,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:56,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:56,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:15:56,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1992273542, now seen corresponding path program 1 times [2025-03-08 06:15:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:56,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418837690] [2025-03-08 06:15:56,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:56,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:15:56,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:15:56,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:56,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:56,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:56,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418837690] [2025-03-08 06:15:56,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418837690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:56,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:56,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:56,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462895809] [2025-03-08 06:15:56,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:56,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:56,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:56,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:56,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:56,617 INFO L87 Difference]: Start difference. First operand 748 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:56,644 INFO L93 Difference]: Finished difference Result 1859 states and 2747 transitions. [2025-03-08 06:15:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:56,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 06:15:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:56,649 INFO L225 Difference]: With dead ends: 1859 [2025-03-08 06:15:56,649 INFO L226 Difference]: Without dead ends: 1295 [2025-03-08 06:15:56,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:56,650 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 434 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-03-08 06:15:56,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:15:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-03-08 06:15:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1293. [2025-03-08 06:15:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1874 transitions. [2025-03-08 06:15:56,678 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1874 transitions. Word has length 53 [2025-03-08 06:15:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:56,678 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1874 transitions. [2025-03-08 06:15:56,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1874 transitions. [2025-03-08 06:15:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:15:56,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:56,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:56,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:15:56,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:56,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 280394173, now seen corresponding path program 1 times [2025-03-08 06:15:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:56,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720179664] [2025-03-08 06:15:56,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:56,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:15:56,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:15:56,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:56,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720179664] [2025-03-08 06:15:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720179664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:56,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:15:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338024498] [2025-03-08 06:15:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:15:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:56,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:15:56,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:56,797 INFO L87 Difference]: Start difference. First operand 1293 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:56,896 INFO L93 Difference]: Finished difference Result 2516 states and 3713 transitions. [2025-03-08 06:15:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:15:56,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 06:15:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:56,904 INFO L225 Difference]: With dead ends: 2516 [2025-03-08 06:15:56,904 INFO L226 Difference]: Without dead ends: 2150 [2025-03-08 06:15:56,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:56,906 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 623 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:56,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 992 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2025-03-08 06:15:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1728. [2025-03-08 06:15:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.457440648523451) internal successors, (2517), 1727 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2517 transitions. [2025-03-08 06:15:56,949 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2517 transitions. Word has length 54 [2025-03-08 06:15:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:56,950 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2517 transitions. [2025-03-08 06:15:56,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2517 transitions. [2025-03-08 06:15:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:15:56,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:56,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:56,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:15:56,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:56,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2098766610, now seen corresponding path program 1 times [2025-03-08 06:15:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:56,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813646446] [2025-03-08 06:15:56,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:56,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:15:56,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:15:56,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:56,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813646446] [2025-03-08 06:15:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813646446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:57,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:57,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:15:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351541900] [2025-03-08 06:15:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:15:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:57,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:15:57,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:57,082 INFO L87 Difference]: Start difference. First operand 1728 states and 2517 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:57,159 INFO L93 Difference]: Finished difference Result 2915 states and 4303 transitions. [2025-03-08 06:15:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:15:57,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 06:15:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:57,168 INFO L225 Difference]: With dead ends: 2915 [2025-03-08 06:15:57,168 INFO L226 Difference]: Without dead ends: 2549 [2025-03-08 06:15:57,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:57,170 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 629 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:57,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 975 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:15:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2025-03-08 06:15:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2064. [2025-03-08 06:15:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 2063 states have (on average 1.4624333494910324) internal successors, (3017), 2063 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 3017 transitions. [2025-03-08 06:15:57,220 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 3017 transitions. Word has length 54 [2025-03-08 06:15:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:57,221 INFO L471 AbstractCegarLoop]: Abstraction has 2064 states and 3017 transitions. [2025-03-08 06:15:57,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 3017 transitions. [2025-03-08 06:15:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:15:57,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:57,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:57,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:15:57,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:57,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1259121654, now seen corresponding path program 1 times [2025-03-08 06:15:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:57,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595089140] [2025-03-08 06:15:57,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:57,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:15:57,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:15:57,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:57,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595089140] [2025-03-08 06:15:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595089140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:57,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:15:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510952388] [2025-03-08 06:15:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:57,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:15:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:57,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:15:57,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:57,330 INFO L87 Difference]: Start difference. First operand 2064 states and 3017 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:57,415 INFO L93 Difference]: Finished difference Result 3367 states and 4972 transitions. [2025-03-08 06:15:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:15:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 06:15:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:57,423 INFO L225 Difference]: With dead ends: 3367 [2025-03-08 06:15:57,424 INFO L226 Difference]: Without dead ends: 3001 [2025-03-08 06:15:57,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:57,428 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 632 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:57,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1129 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2025-03-08 06:15:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2382. [2025-03-08 06:15:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3492 transitions. [2025-03-08 06:15:57,474 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3492 transitions. Word has length 54 [2025-03-08 06:15:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:57,475 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 3492 transitions. [2025-03-08 06:15:57,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3492 transitions. [2025-03-08 06:15:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 06:15:57,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:57,479 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] [2025-03-08 06:15:57,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:15:57,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:57,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash -892469633, now seen corresponding path program 1 times [2025-03-08 06:15:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604268112] [2025-03-08 06:15:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:57,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 06:15:57,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 06:15:57,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:57,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:57,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604268112] [2025-03-08 06:15:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604268112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:57,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:15:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166954802] [2025-03-08 06:15:57,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:57,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:15:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:57,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:15:57,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:57,599 INFO L87 Difference]: Start difference. First operand 2382 states and 3492 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:57,811 INFO L93 Difference]: Finished difference Result 5655 states and 8292 transitions. [2025-03-08 06:15:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:15:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 06:15:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:57,823 INFO L225 Difference]: With dead ends: 5655 [2025-03-08 06:15:57,823 INFO L226 Difference]: Without dead ends: 3319 [2025-03-08 06:15:57,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:57,828 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 896 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:57,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 226 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:15:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2025-03-08 06:15:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3301. [2025-03-08 06:15:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 3300 states have (on average 1.455151515151515) internal successors, (4802), 3300 states have internal predecessors, (4802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4802 transitions. [2025-03-08 06:15:57,889 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4802 transitions. Word has length 58 [2025-03-08 06:15:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:57,889 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 4802 transitions. [2025-03-08 06:15:57,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4802 transitions. [2025-03-08 06:15:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 06:15:57,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:57,891 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] [2025-03-08 06:15:57,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:15:57,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:57,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1243377130, now seen corresponding path program 1 times [2025-03-08 06:15:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838930782] [2025-03-08 06:15:57,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:57,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 06:15:57,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 06:15:57,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:57,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838930782] [2025-03-08 06:15:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838930782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:15:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99445091] [2025-03-08 06:15:57,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:15:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:57,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:15:57,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:57,985 INFO L87 Difference]: Start difference. First operand 3301 states and 4802 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:58,239 INFO L93 Difference]: Finished difference Result 9446 states and 13769 transitions. [2025-03-08 06:15:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:15:58,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 06:15:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:58,256 INFO L225 Difference]: With dead ends: 9446 [2025-03-08 06:15:58,257 INFO L226 Difference]: Without dead ends: 6173 [2025-03-08 06:15:58,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:58,263 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 928 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:58,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 216 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:15:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2025-03-08 06:15:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 6136. [2025-03-08 06:15:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6136 states, 6135 states have (on average 1.4454767726161368) internal successors, (8868), 6135 states have internal predecessors, (8868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6136 states to 6136 states and 8868 transitions. [2025-03-08 06:15:58,385 INFO L78 Accepts]: Start accepts. Automaton has 6136 states and 8868 transitions. Word has length 58 [2025-03-08 06:15:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:58,385 INFO L471 AbstractCegarLoop]: Abstraction has 6136 states and 8868 transitions. [2025-03-08 06:15:58,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6136 states and 8868 transitions. [2025-03-08 06:15:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 06:15:58,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:58,388 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] [2025-03-08 06:15:58,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:15:58,389 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:58,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1969917559, now seen corresponding path program 1 times [2025-03-08 06:15:58,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:58,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139863819] [2025-03-08 06:15:58,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:58,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 06:15:58,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 06:15:58,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:58,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139863819] [2025-03-08 06:15:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139863819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:58,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:15:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743912979] [2025-03-08 06:15:58,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:58,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:15:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:58,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:15:58,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:58,472 INFO L87 Difference]: Start difference. First operand 6136 states and 8868 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:58,674 INFO L93 Difference]: Finished difference Result 14628 states and 21107 transitions. [2025-03-08 06:15:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:15:58,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-08 06:15:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:58,698 INFO L225 Difference]: With dead ends: 14628 [2025-03-08 06:15:58,699 INFO L226 Difference]: Without dead ends: 8574 [2025-03-08 06:15:58,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:58,707 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 845 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:58,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 228 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8574 states. [2025-03-08 06:15:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8574 to 8526. [2025-03-08 06:15:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8526 states, 8525 states have (on average 1.4294428152492669) internal successors, (12186), 8525 states have internal predecessors, (12186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8526 states to 8526 states and 12186 transitions. [2025-03-08 06:15:58,849 INFO L78 Accepts]: Start accepts. Automaton has 8526 states and 12186 transitions. Word has length 59 [2025-03-08 06:15:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:58,849 INFO L471 AbstractCegarLoop]: Abstraction has 8526 states and 12186 transitions. [2025-03-08 06:15:58,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 8526 states and 12186 transitions. [2025-03-08 06:15:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:15:58,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:58,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:58,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:15:58,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:58,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1462825551, now seen corresponding path program 1 times [2025-03-08 06:15:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921287222] [2025-03-08 06:15:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:58,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:15:58,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:15:58,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:58,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:58,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921287222] [2025-03-08 06:15:58,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921287222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:58,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:58,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:15:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077899412] [2025-03-08 06:15:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:58,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:15:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:58,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:15:58,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:58,979 INFO L87 Difference]: Start difference. First operand 8526 states and 12186 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:59,313 INFO L93 Difference]: Finished difference Result 25210 states and 35728 transitions. [2025-03-08 06:15:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:15:59,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 06:15:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:59,356 INFO L225 Difference]: With dead ends: 25210 [2025-03-08 06:15:59,356 INFO L226 Difference]: Without dead ends: 22112 [2025-03-08 06:15:59,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:15:59,369 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1456 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:59,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 386 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:15:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22112 states. [2025-03-08 06:15:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22112 to 8582. [2025-03-08 06:15:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8582 states, 8581 states have (on average 1.428155226663559) internal successors, (12255), 8581 states have internal predecessors, (12255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 12255 transitions. [2025-03-08 06:15:59,612 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 12255 transitions. Word has length 60 [2025-03-08 06:15:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:59,612 INFO L471 AbstractCegarLoop]: Abstraction has 8582 states and 12255 transitions. [2025-03-08 06:15:59,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 12255 transitions. [2025-03-08 06:15:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:15:59,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:59,615 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] [2025-03-08 06:15:59,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:15:59,615 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:59,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -905158643, now seen corresponding path program 1 times [2025-03-08 06:15:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483572419] [2025-03-08 06:15:59,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:59,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:15:59,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:15:59,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:59,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483572419] [2025-03-08 06:15:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483572419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:59,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:59,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:15:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695404045] [2025-03-08 06:15:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:59,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:15:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:59,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:15:59,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:15:59,727 INFO L87 Difference]: Start difference. First operand 8582 states and 12255 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:00,002 INFO L93 Difference]: Finished difference Result 19400 states and 27496 transitions. [2025-03-08 06:16:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:16:00,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 06:16:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:00,030 INFO L225 Difference]: With dead ends: 19400 [2025-03-08 06:16:00,030 INFO L226 Difference]: Without dead ends: 15022 [2025-03-08 06:16:00,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:16:00,045 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1110 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:00,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 325 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:16:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15022 states. [2025-03-08 06:16:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15022 to 8602. [2025-03-08 06:16:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8602 states, 8601 states have (on average 1.4276246948029299) internal successors, (12279), 8601 states have internal predecessors, (12279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8602 states to 8602 states and 12279 transitions. [2025-03-08 06:16:00,225 INFO L78 Accepts]: Start accepts. Automaton has 8602 states and 12279 transitions. Word has length 60 [2025-03-08 06:16:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:00,225 INFO L471 AbstractCegarLoop]: Abstraction has 8602 states and 12279 transitions. [2025-03-08 06:16:00,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8602 states and 12279 transitions. [2025-03-08 06:16:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:16:00,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:00,228 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] [2025-03-08 06:16:00,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:16:00,229 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1528767602, now seen corresponding path program 1 times [2025-03-08 06:16:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540338914] [2025-03-08 06:16:00,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:00,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:16:00,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:16:00,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:00,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:00,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540338914] [2025-03-08 06:16:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540338914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:00,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:16:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756857835] [2025-03-08 06:16:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:00,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:16:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:00,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:16:00,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:00,345 INFO L87 Difference]: Start difference. First operand 8602 states and 12279 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:00,640 INFO L93 Difference]: Finished difference Result 22585 states and 32094 transitions. [2025-03-08 06:16:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:16:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 06:16:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:00,672 INFO L225 Difference]: With dead ends: 22585 [2025-03-08 06:16:00,672 INFO L226 Difference]: Without dead ends: 18331 [2025-03-08 06:16:00,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:16:00,683 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1291 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:00,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 373 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:16:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18331 states. [2025-03-08 06:16:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18331 to 8712. [2025-03-08 06:16:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 8711 states have (on average 1.4258982895189989) internal successors, (12421), 8711 states have internal predecessors, (12421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 12421 transitions. [2025-03-08 06:16:00,863 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 12421 transitions. Word has length 60 [2025-03-08 06:16:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:00,863 INFO L471 AbstractCegarLoop]: Abstraction has 8712 states and 12421 transitions. [2025-03-08 06:16:00,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 12421 transitions. [2025-03-08 06:16:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:16:00,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:00,867 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] [2025-03-08 06:16:00,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:16:00,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:00,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1968296949, now seen corresponding path program 1 times [2025-03-08 06:16:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038005234] [2025-03-08 06:16:00,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:00,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:16:00,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:16:00,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:00,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038005234] [2025-03-08 06:16:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038005234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:01,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:16:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271963170] [2025-03-08 06:16:01,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:01,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:16:01,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:01,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:16:01,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:16:01,189 INFO L87 Difference]: Start difference. First operand 8712 states and 12421 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:01,743 INFO L93 Difference]: Finished difference Result 20942 states and 29948 transitions. [2025-03-08 06:16:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:16:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 06:16:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:01,767 INFO L225 Difference]: With dead ends: 20942 [2025-03-08 06:16:01,767 INFO L226 Difference]: Without dead ends: 13771 [2025-03-08 06:16:01,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:16:01,774 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1027 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:01,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 906 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:16:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13771 states. [2025-03-08 06:16:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13771 to 8546. [2025-03-08 06:16:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8546 states, 8545 states have (on average 1.423990637799883) internal successors, (12168), 8545 states have internal predecessors, (12168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8546 states to 8546 states and 12168 transitions. [2025-03-08 06:16:01,944 INFO L78 Accepts]: Start accepts. Automaton has 8546 states and 12168 transitions. Word has length 62 [2025-03-08 06:16:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:01,945 INFO L471 AbstractCegarLoop]: Abstraction has 8546 states and 12168 transitions. [2025-03-08 06:16:01,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 8546 states and 12168 transitions. [2025-03-08 06:16:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:16:01,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:01,949 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] [2025-03-08 06:16:01,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:16:01,949 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:01,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash -731999476, now seen corresponding path program 1 times [2025-03-08 06:16:01,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:01,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267684640] [2025-03-08 06:16:01,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:01,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:01,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:16:01,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:16:01,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:01,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:02,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-03-08 06:16:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267684640] [2025-03-08 06:16:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267684640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:02,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:02,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:16:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726933776] [2025-03-08 06:16:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:02,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:16:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:02,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:16:02,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:16:02,265 INFO L87 Difference]: Start difference. First operand 8546 states and 12168 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:02,872 INFO L93 Difference]: Finished difference Result 19626 states and 27922 transitions. [2025-03-08 06:16:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:16:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 06:16:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:02,903 INFO L225 Difference]: With dead ends: 19626 [2025-03-08 06:16:02,903 INFO L226 Difference]: Without dead ends: 12316 [2025-03-08 06:16:02,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:16:02,916 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1030 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:02,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 876 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:16:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12316 states. [2025-03-08 06:16:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12316 to 8253. [2025-03-08 06:16:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8253 states, 8252 states have (on average 1.422927775084828) internal successors, (11742), 8252 states have internal predecessors, (11742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8253 states to 8253 states and 11742 transitions. [2025-03-08 06:16:03,093 INFO L78 Accepts]: Start accepts. Automaton has 8253 states and 11742 transitions. Word has length 62 [2025-03-08 06:16:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:03,093 INFO L471 AbstractCegarLoop]: Abstraction has 8253 states and 11742 transitions. [2025-03-08 06:16:03,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 8253 states and 11742 transitions. [2025-03-08 06:16:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:16:03,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:03,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:03,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:16:03,095 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:03,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash -255068851, now seen corresponding path program 1 times [2025-03-08 06:16:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791962506] [2025-03-08 06:16:03,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:03,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:16:03,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:16:03,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:03,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791962506] [2025-03-08 06:16:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791962506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:16:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178920706] [2025-03-08 06:16:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:03,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:16:03,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:03,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:16:03,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:16:03,315 INFO L87 Difference]: Start difference. First operand 8253 states and 11742 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:03,743 INFO L93 Difference]: Finished difference Result 20382 states and 29106 transitions. [2025-03-08 06:16:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:16:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 06:16:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:03,760 INFO L225 Difference]: With dead ends: 20382 [2025-03-08 06:16:03,760 INFO L226 Difference]: Without dead ends: 13279 [2025-03-08 06:16:03,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:16:03,769 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1223 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:03,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 740 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:16:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2025-03-08 06:16:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 8112. [2025-03-08 06:16:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8112 states, 8111 states have (on average 1.423622241400567) internal successors, (11547), 8111 states have internal predecessors, (11547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8112 states to 8112 states and 11547 transitions. [2025-03-08 06:16:03,880 INFO L78 Accepts]: Start accepts. Automaton has 8112 states and 11547 transitions. Word has length 62 [2025-03-08 06:16:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:03,880 INFO L471 AbstractCegarLoop]: Abstraction has 8112 states and 11547 transitions. [2025-03-08 06:16:03,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 8112 states and 11547 transitions. [2025-03-08 06:16:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:16:03,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:03,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:03,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:16:03,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:03,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 31598955, now seen corresponding path program 1 times [2025-03-08 06:16:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:03,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180467005] [2025-03-08 06:16:03,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:03,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:16:03,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:16:03,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:03,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:03,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180467005] [2025-03-08 06:16:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180467005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:03,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526861805] [2025-03-08 06:16:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:03,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:03,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:03,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:03,925 INFO L87 Difference]: Start difference. First operand 8112 states and 11547 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:03,987 INFO L93 Difference]: Finished difference Result 11169 states and 15856 transitions. [2025-03-08 06:16:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:03,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 06:16:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:03,995 INFO L225 Difference]: With dead ends: 11169 [2025-03-08 06:16:03,995 INFO L226 Difference]: Without dead ends: 7915 [2025-03-08 06:16:03,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:03,997 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 150 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:03,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 525 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7915 states. [2025-03-08 06:16:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7915 to 7913. [2025-03-08 06:16:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7913 states, 7912 states have (on average 1.397118301314459) internal successors, (11054), 7912 states have internal predecessors, (11054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7913 states to 7913 states and 11054 transitions. [2025-03-08 06:16:04,065 INFO L78 Accepts]: Start accepts. Automaton has 7913 states and 11054 transitions. Word has length 63 [2025-03-08 06:16:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:04,065 INFO L471 AbstractCegarLoop]: Abstraction has 7913 states and 11054 transitions. [2025-03-08 06:16:04,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7913 states and 11054 transitions. [2025-03-08 06:16:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:16:04,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:04,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:04,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:16:04,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1192185867, now seen corresponding path program 1 times [2025-03-08 06:16:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:04,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418721027] [2025-03-08 06:16:04,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:04,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:16:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:16:04,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:04,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418721027] [2025-03-08 06:16:04,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418721027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:04,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:04,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368317189] [2025-03-08 06:16:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:04,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:04,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:04,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:04,106 INFO L87 Difference]: Start difference. First operand 7913 states and 11054 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:04,134 INFO L93 Difference]: Finished difference Result 11341 states and 15844 transitions. [2025-03-08 06:16:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 06:16:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:04,142 INFO L225 Difference]: With dead ends: 11341 [2025-03-08 06:16:04,142 INFO L226 Difference]: Without dead ends: 7014 [2025-03-08 06:16:04,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:04,147 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 148 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 528 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-03-08 06:16:04,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 528 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2025-03-08 06:16:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 7012. [2025-03-08 06:16:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7012 states, 7011 states have (on average 1.3774069319640565) internal successors, (9657), 7011 states have internal predecessors, (9657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7012 states to 7012 states and 9657 transitions. [2025-03-08 06:16:04,219 INFO L78 Accepts]: Start accepts. Automaton has 7012 states and 9657 transitions. Word has length 63 [2025-03-08 06:16:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:04,219 INFO L471 AbstractCegarLoop]: Abstraction has 7012 states and 9657 transitions. [2025-03-08 06:16:04,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7012 states and 9657 transitions. [2025-03-08 06:16:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:16:04,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:04,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:16:04,222 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1538920789, now seen corresponding path program 1 times [2025-03-08 06:16:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033159640] [2025-03-08 06:16:04,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:04,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:16:04,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:16:04,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:04,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033159640] [2025-03-08 06:16:04,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033159640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:04,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:04,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388247618] [2025-03-08 06:16:04,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:04,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:04,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:04,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:04,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:04,261 INFO L87 Difference]: Start difference. First operand 7012 states and 9657 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:04,292 INFO L93 Difference]: Finished difference Result 9384 states and 12912 transitions. [2025-03-08 06:16:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 06:16:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:04,299 INFO L225 Difference]: With dead ends: 9384 [2025-03-08 06:16:04,299 INFO L226 Difference]: Without dead ends: 5436 [2025-03-08 06:16:04,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:04,303 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 136 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 528 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-03-08 06:16:04,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 528 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2025-03-08 06:16:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5434. [2025-03-08 06:16:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5434 states, 5433 states have (on average 1.3519234308853303) internal successors, (7345), 5433 states have internal predecessors, (7345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 7345 transitions. [2025-03-08 06:16:04,354 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 7345 transitions. Word has length 63 [2025-03-08 06:16:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:04,354 INFO L471 AbstractCegarLoop]: Abstraction has 5434 states and 7345 transitions. [2025-03-08 06:16:04,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 7345 transitions. [2025-03-08 06:16:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:16:04,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:04,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:04,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:16:04,357 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:04,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 686058653, now seen corresponding path program 1 times [2025-03-08 06:16:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921081] [2025-03-08 06:16:04,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:04,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:16:04,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:16:04,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:04,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:04,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:04,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921081] [2025-03-08 06:16:04,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:04,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768695457] [2025-03-08 06:16:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:04,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:04,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:04,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:04,390 INFO L87 Difference]: Start difference. First operand 5434 states and 7345 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:04,439 INFO L93 Difference]: Finished difference Result 8294 states and 11218 transitions. [2025-03-08 06:16:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:16:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:04,445 INFO L225 Difference]: With dead ends: 8294 [2025-03-08 06:16:04,446 INFO L226 Difference]: Without dead ends: 6353 [2025-03-08 06:16:04,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:04,449 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 171 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:04,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 343 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2025-03-08 06:16:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 5212. [2025-03-08 06:16:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5212 states, 5211 states have (on average 1.3519478027250047) internal successors, (7045), 5211 states have internal predecessors, (7045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 7045 transitions. [2025-03-08 06:16:04,491 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 7045 transitions. Word has length 64 [2025-03-08 06:16:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:04,491 INFO L471 AbstractCegarLoop]: Abstraction has 5212 states and 7045 transitions. [2025-03-08 06:16:04,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 7045 transitions. [2025-03-08 06:16:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:16:04,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:04,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:04,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:16:04,493 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:04,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1555716861, now seen corresponding path program 1 times [2025-03-08 06:16:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:04,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199878475] [2025-03-08 06:16:04,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:04,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:16:04,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:16:04,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:04,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199878475] [2025-03-08 06:16:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199878475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:04,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097828024] [2025-03-08 06:16:04,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:04,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:04,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:04,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:04,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:04,532 INFO L87 Difference]: Start difference. First operand 5212 states and 7045 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:04,597 INFO L93 Difference]: Finished difference Result 9752 states and 13247 transitions. [2025-03-08 06:16:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:04,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:16:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:04,605 INFO L225 Difference]: With dead ends: 9752 [2025-03-08 06:16:04,605 INFO L226 Difference]: Without dead ends: 7131 [2025-03-08 06:16:04,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:04,611 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 169 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 343 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-03-08 06:16:04,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 343 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7131 states. [2025-03-08 06:16:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7131 to 4998. [2025-03-08 06:16:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4998 states, 4997 states have (on average 1.3506103662197317) internal successors, (6749), 4997 states have internal predecessors, (6749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 6749 transitions. [2025-03-08 06:16:04,665 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 6749 transitions. Word has length 64 [2025-03-08 06:16:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:04,665 INFO L471 AbstractCegarLoop]: Abstraction has 4998 states and 6749 transitions. [2025-03-08 06:16:04,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 6749 transitions. [2025-03-08 06:16:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:16:04,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:04,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] [2025-03-08 06:16:04,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:16:04,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:04,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1323961782, now seen corresponding path program 1 times [2025-03-08 06:16:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:04,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574091674] [2025-03-08 06:16:04,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:04,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:16:04,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:16:04,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:04,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:05,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:05,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574091674] [2025-03-08 06:16:05,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574091674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:05,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:05,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 06:16:05,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249606547] [2025-03-08 06:16:05,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:05,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 06:16:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:05,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 06:16:05,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:16:05,667 INFO L87 Difference]: Start difference. First operand 4998 states and 6749 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:07,868 INFO L93 Difference]: Finished difference Result 8297 states and 11247 transitions. [2025-03-08 06:16:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 06:16:07,868 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:16:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:07,877 INFO L225 Difference]: With dead ends: 8297 [2025-03-08 06:16:07,878 INFO L226 Difference]: Without dead ends: 8181 [2025-03-08 06:16:07,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 06:16:07,883 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 1373 mSDsluCounter, 3307 mSDsCounter, 0 mSdLazyCounter, 2438 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:07,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3569 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2438 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:16:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8181 states. [2025-03-08 06:16:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8181 to 4998. [2025-03-08 06:16:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4998 states, 4997 states have (on average 1.3504102461476886) internal successors, (6748), 4997 states have internal predecessors, (6748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 6748 transitions. [2025-03-08 06:16:07,939 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 6748 transitions. Word has length 64 [2025-03-08 06:16:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:07,939 INFO L471 AbstractCegarLoop]: Abstraction has 4998 states and 6748 transitions. [2025-03-08 06:16:07,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 6748 transitions. [2025-03-08 06:16:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:16:07,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:07,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:07,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:16:07,942 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:07,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash -777995691, now seen corresponding path program 1 times [2025-03-08 06:16:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:07,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086934613] [2025-03-08 06:16:07,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:07,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:16:07,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:16:07,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:07,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:08,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:08,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086934613] [2025-03-08 06:16:08,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086934613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:08,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:08,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 06:16:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072290223] [2025-03-08 06:16:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 06:16:08,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:08,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 06:16:08,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:16:08,815 INFO L87 Difference]: Start difference. First operand 4998 states and 6748 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:10,728 INFO L93 Difference]: Finished difference Result 7279 states and 9838 transitions. [2025-03-08 06:16:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 06:16:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:16:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:10,735 INFO L225 Difference]: With dead ends: 7279 [2025-03-08 06:16:10,735 INFO L226 Difference]: Without dead ends: 7163 [2025-03-08 06:16:10,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=311, Invalid=1411, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 06:16:10,737 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1778 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:10,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 3572 Invalid, 2670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2656 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:16:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7163 states. [2025-03-08 06:16:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7163 to 5004. [2025-03-08 06:16:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 5003 states have (on average 1.350189886068359) internal successors, (6755), 5003 states have internal predecessors, (6755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 6755 transitions. [2025-03-08 06:16:10,783 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 6755 transitions. Word has length 64 [2025-03-08 06:16:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:10,783 INFO L471 AbstractCegarLoop]: Abstraction has 5004 states and 6755 transitions. [2025-03-08 06:16:10,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 6755 transitions. [2025-03-08 06:16:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:16:10,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:10,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:10,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:16:10,785 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:10,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash 461441588, now seen corresponding path program 1 times [2025-03-08 06:16:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311465743] [2025-03-08 06:16:10,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:10,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:16:10,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:16:10,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:10,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:11,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311465743] [2025-03-08 06:16:11,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311465743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:11,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:11,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:16:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870681300] [2025-03-08 06:16:11,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:11,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:16:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:11,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:16:11,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:16:11,183 INFO L87 Difference]: Start difference. First operand 5004 states and 6755 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:12,073 INFO L93 Difference]: Finished difference Result 10560 states and 14341 transitions. [2025-03-08 06:16:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 06:16:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:16:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:12,084 INFO L225 Difference]: With dead ends: 10560 [2025-03-08 06:16:12,084 INFO L226 Difference]: Without dead ends: 9884 [2025-03-08 06:16:12,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-03-08 06:16:12,087 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1885 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:12,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 2628 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:16:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9884 states. [2025-03-08 06:16:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9884 to 4886. [2025-03-08 06:16:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4886 states, 4885 states have (on average 1.3506653019447288) internal successors, (6598), 4885 states have internal predecessors, (6598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 6598 transitions. [2025-03-08 06:16:12,152 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 6598 transitions. Word has length 64 [2025-03-08 06:16:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:12,153 INFO L471 AbstractCegarLoop]: Abstraction has 4886 states and 6598 transitions. [2025-03-08 06:16:12,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 6598 transitions. [2025-03-08 06:16:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:16:12,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:12,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:12,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:16:12,155 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:12,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1743229389, now seen corresponding path program 1 times [2025-03-08 06:16:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114488174] [2025-03-08 06:16:12,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:12,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:16:12,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:16:12,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:12,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:12,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114488174] [2025-03-08 06:16:12,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114488174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:12,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:12,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:12,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403165819] [2025-03-08 06:16:12,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:12,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:12,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:12,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:12,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:12,185 INFO L87 Difference]: Start difference. First operand 4886 states and 6598 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:12,223 INFO L93 Difference]: Finished difference Result 9202 states and 12497 transitions. [2025-03-08 06:16:12,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:12,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:16:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:12,231 INFO L225 Difference]: With dead ends: 9202 [2025-03-08 06:16:12,231 INFO L226 Difference]: Without dead ends: 6630 [2025-03-08 06:16:12,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:12,235 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 170 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:12,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 345 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2025-03-08 06:16:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 4614. [2025-03-08 06:16:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4614 states, 4613 states have (on average 1.3503143290700195) internal successors, (6229), 4613 states have internal predecessors, (6229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6229 transitions. [2025-03-08 06:16:12,307 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6229 transitions. Word has length 64 [2025-03-08 06:16:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:12,307 INFO L471 AbstractCegarLoop]: Abstraction has 4614 states and 6229 transitions. [2025-03-08 06:16:12,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6229 transitions. [2025-03-08 06:16:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 06:16:12,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:12,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:12,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:16:12,309 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:12,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1913604299, now seen corresponding path program 1 times [2025-03-08 06:16:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820003002] [2025-03-08 06:16:12,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:12,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 06:16:12,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 06:16:12,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:12,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820003002] [2025-03-08 06:16:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820003002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:12,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 06:16:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573195407] [2025-03-08 06:16:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 06:16:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:12,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 06:16:12,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:16:12,781 INFO L87 Difference]: Start difference. First operand 4614 states and 6229 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:13,569 INFO L93 Difference]: Finished difference Result 7902 states and 10730 transitions. [2025-03-08 06:16:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 06:16:13,570 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 06:16:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:13,576 INFO L225 Difference]: With dead ends: 7902 [2025-03-08 06:16:13,576 INFO L226 Difference]: Without dead ends: 7463 [2025-03-08 06:16:13,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2025-03-08 06:16:13,578 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 799 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:13,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2249 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:16:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2025-03-08 06:16:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 4533. [2025-03-08 06:16:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 4532 states have (on average 1.3506178287731685) internal successors, (6121), 4532 states have internal predecessors, (6121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 6121 transitions. [2025-03-08 06:16:13,627 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 6121 transitions. Word has length 65 [2025-03-08 06:16:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:13,627 INFO L471 AbstractCegarLoop]: Abstraction has 4533 states and 6121 transitions. [2025-03-08 06:16:13,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 6121 transitions. [2025-03-08 06:16:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:16:13,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:13,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:13,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:16:13,630 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:13,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1683452360, now seen corresponding path program 1 times [2025-03-08 06:16:13,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:13,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702347558] [2025-03-08 06:16:13,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:13,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:16:13,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:16:13,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:13,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:13,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702347558] [2025-03-08 06:16:13,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702347558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:13,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:16:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330439246] [2025-03-08 06:16:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:13,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:16:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:13,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:16:13,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:13,696 INFO L87 Difference]: Start difference. First operand 4533 states and 6121 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:13,748 INFO L93 Difference]: Finished difference Result 4539 states and 6124 transitions. [2025-03-08 06:16:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:16:13,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 06:16:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:13,753 INFO L225 Difference]: With dead ends: 4539 [2025-03-08 06:16:13,753 INFO L226 Difference]: Without dead ends: 4096 [2025-03-08 06:16:13,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:16:13,755 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 536 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:13,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 646 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2025-03-08 06:16:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 4092. [2025-03-08 06:16:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4091 states have (on average 1.3551698851136642) internal successors, (5544), 4091 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 5544 transitions. [2025-03-08 06:16:13,831 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 5544 transitions. Word has length 69 [2025-03-08 06:16:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:13,831 INFO L471 AbstractCegarLoop]: Abstraction has 4092 states and 5544 transitions. [2025-03-08 06:16:13,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 5544 transitions. [2025-03-08 06:16:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:16:13,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:13,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:13,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:16:13,835 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:13,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash -975909036, now seen corresponding path program 1 times [2025-03-08 06:16:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:13,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37344959] [2025-03-08 06:16:13,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:13,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:16:13,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:16:13,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:13,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:13,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:13,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37344959] [2025-03-08 06:16:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37344959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:13,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541771330] [2025-03-08 06:16:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:13,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:13,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:13,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:13,905 INFO L87 Difference]: Start difference. First operand 4092 states and 5544 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:13,936 INFO L93 Difference]: Finished difference Result 10743 states and 14661 transitions. [2025-03-08 06:16:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-08 06:16:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:13,943 INFO L225 Difference]: With dead ends: 10743 [2025-03-08 06:16:13,943 INFO L226 Difference]: Without dead ends: 7144 [2025-03-08 06:16:13,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:13,947 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 115 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:13,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 430 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7144 states. [2025-03-08 06:16:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7144 to 6674. [2025-03-08 06:16:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6674 states, 6673 states have (on average 1.3484190019481492) internal successors, (8998), 6673 states have internal predecessors, (8998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6674 states to 6674 states and 8998 transitions. [2025-03-08 06:16:14,014 INFO L78 Accepts]: Start accepts. Automaton has 6674 states and 8998 transitions. Word has length 72 [2025-03-08 06:16:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:14,014 INFO L471 AbstractCegarLoop]: Abstraction has 6674 states and 8998 transitions. [2025-03-08 06:16:14,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 6674 states and 8998 transitions. [2025-03-08 06:16:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:16:14,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:14,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:14,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:16:14,016 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:14,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2045297549, now seen corresponding path program 1 times [2025-03-08 06:16:14,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:14,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201302604] [2025-03-08 06:16:14,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:14,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:16:14,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:16:14,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:14,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:14,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201302604] [2025-03-08 06:16:14,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201302604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:14,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:14,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:14,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251936531] [2025-03-08 06:16:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:14,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:14,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:14,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:14,074 INFO L87 Difference]: Start difference. First operand 6674 states and 8998 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:14,117 INFO L93 Difference]: Finished difference Result 18382 states and 24898 transitions. [2025-03-08 06:16:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-08 06:16:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:14,133 INFO L225 Difference]: With dead ends: 18382 [2025-03-08 06:16:14,133 INFO L226 Difference]: Without dead ends: 12218 [2025-03-08 06:16:14,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:14,143 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 105 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:14,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 422 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12218 states. [2025-03-08 06:16:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12218 to 11312. [2025-03-08 06:16:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11312 states, 11311 states have (on average 1.343736186013615) internal successors, (15199), 11311 states have internal predecessors, (15199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11312 states to 11312 states and 15199 transitions. [2025-03-08 06:16:14,254 INFO L78 Accepts]: Start accepts. Automaton has 11312 states and 15199 transitions. Word has length 73 [2025-03-08 06:16:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:14,254 INFO L471 AbstractCegarLoop]: Abstraction has 11312 states and 15199 transitions. [2025-03-08 06:16:14,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11312 states and 15199 transitions. [2025-03-08 06:16:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:16:14,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:14,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:14,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:16:14,256 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:14,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -926075687, now seen corresponding path program 1 times [2025-03-08 06:16:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:14,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595144648] [2025-03-08 06:16:14,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:14,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:16:14,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:16:14,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:14,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:14,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:14,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595144648] [2025-03-08 06:16:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595144648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077937042] [2025-03-08 06:16:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:14,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:14,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:14,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:14,309 INFO L87 Difference]: Start difference. First operand 11312 states and 15199 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:14,369 INFO L93 Difference]: Finished difference Result 31676 states and 42549 transitions. [2025-03-08 06:16:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:16:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:14,391 INFO L225 Difference]: With dead ends: 31676 [2025-03-08 06:16:14,392 INFO L226 Difference]: Without dead ends: 20874 [2025-03-08 06:16:14,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:14,404 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 95 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:14,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20874 states. [2025-03-08 06:16:14,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20874 to 19064. [2025-03-08 06:16:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.3312175418349683) internal successors, (25377), 19063 states have internal predecessors, (25377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 25377 transitions. [2025-03-08 06:16:14,634 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 25377 transitions. Word has length 74 [2025-03-08 06:16:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:14,634 INFO L471 AbstractCegarLoop]: Abstraction has 19064 states and 25377 transitions. [2025-03-08 06:16:14,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 25377 transitions. [2025-03-08 06:16:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:16:14,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:14,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:14,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:16:14,635 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:14,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1230066519, now seen corresponding path program 1 times [2025-03-08 06:16:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074385738] [2025-03-08 06:16:14,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:14,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:16:14,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:16:14,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:14,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074385738] [2025-03-08 06:16:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074385738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:14,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:16:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005167300] [2025-03-08 06:16:14,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:14,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:16:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:14,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:16:14,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:16:14,780 INFO L87 Difference]: Start difference. First operand 19064 states and 25377 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:14,837 INFO L93 Difference]: Finished difference Result 21034 states and 28002 transitions. [2025-03-08 06:16:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:16:14,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 06:16:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:14,859 INFO L225 Difference]: With dead ends: 21034 [2025-03-08 06:16:14,859 INFO L226 Difference]: Without dead ends: 21032 [2025-03-08 06:16:14,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:16:14,867 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:14,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 954 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21032 states. [2025-03-08 06:16:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21032 to 21032. [2025-03-08 06:16:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21032 states, 21031 states have (on average 1.300223479625315) internal successors, (27345), 21031 states have internal predecessors, (27345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21032 states to 21032 states and 27345 transitions. [2025-03-08 06:16:15,076 INFO L78 Accepts]: Start accepts. Automaton has 21032 states and 27345 transitions. Word has length 77 [2025-03-08 06:16:15,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:15,076 INFO L471 AbstractCegarLoop]: Abstraction has 21032 states and 27345 transitions. [2025-03-08 06:16:15,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 21032 states and 27345 transitions. [2025-03-08 06:16:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:16:15,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:15,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:15,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:16:15,077 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:15,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:15,078 INFO L85 PathProgramCache]: Analyzing trace with hash 670440263, now seen corresponding path program 1 times [2025-03-08 06:16:15,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:15,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986286571] [2025-03-08 06:16:15,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:15,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:16:15,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:16:15,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:15,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:15,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:15,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986286571] [2025-03-08 06:16:15,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986286571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:15,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:15,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:16:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597212625] [2025-03-08 06:16:15,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:15,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:16:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:15,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:16:15,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:15,115 INFO L87 Difference]: Start difference. First operand 21032 states and 27345 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-03-08 06:16:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:15,217 INFO L93 Difference]: Finished difference Result 51852 states and 67059 transitions. [2025-03-08 06:16:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:16:15,218 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-03-08 06:16:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:15,260 INFO L225 Difference]: With dead ends: 51852 [2025-03-08 06:16:15,260 INFO L226 Difference]: Without dead ends: 31330 [2025-03-08 06:16:15,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:16:15,284 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 131 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:15,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 341 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:16:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31330 states. [2025-03-08 06:16:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31330 to 31328. [2025-03-08 06:16:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31328 states, 31327 states have (on average 1.2754812142879943) internal successors, (39957), 31327 states have internal predecessors, (39957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31328 states to 31328 states and 39957 transitions. [2025-03-08 06:16:15,739 INFO L78 Accepts]: Start accepts. Automaton has 31328 states and 39957 transitions. Word has length 78 [2025-03-08 06:16:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:15,739 INFO L471 AbstractCegarLoop]: Abstraction has 31328 states and 39957 transitions. [2025-03-08 06:16:15,739 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-03-08 06:16:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 31328 states and 39957 transitions. [2025-03-08 06:16:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:16:15,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:15,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:15,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:16:15,745 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:15,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:15,746 INFO L85 PathProgramCache]: Analyzing trace with hash -927831153, now seen corresponding path program 1 times [2025-03-08 06:16:15,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:15,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907589017] [2025-03-08 06:16:15,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:15,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:16:15,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:16:15,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:15,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907589017] [2025-03-08 06:16:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907589017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:16:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708281317] [2025-03-08 06:16:15,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:16:15,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:16:15,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:16:15,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:16:16,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:16:16,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:16:16,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:16,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:16,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:16:16,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:16:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:17,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:16:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:17,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708281317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:16:17,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:16:17,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 29 [2025-03-08 06:16:17,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276174560] [2025-03-08 06:16:17,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:16:17,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:16:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:17,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:16:17,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:16:17,904 INFO L87 Difference]: Start difference. First operand 31328 states and 39957 transitions. Second operand has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 29 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:28,176 INFO L93 Difference]: Finished difference Result 227276 states and 286455 transitions. [2025-03-08 06:16:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2025-03-08 06:16:28,177 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 29 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:16:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:28,473 INFO L225 Difference]: With dead ends: 227276 [2025-03-08 06:16:28,473 INFO L226 Difference]: Without dead ends: 211122 [2025-03-08 06:16:28,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20882 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=7450, Invalid=44762, Unknown=0, NotChecked=0, Total=52212 [2025-03-08 06:16:28,518 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 10043 mSDsluCounter, 4937 mSDsCounter, 0 mSdLazyCounter, 5289 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10043 SdHoareTripleChecker+Valid, 5283 SdHoareTripleChecker+Invalid, 5451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 5289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:28,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10043 Valid, 5283 Invalid, 5451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 5289 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 06:16:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211122 states. [2025-03-08 06:16:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211122 to 65955. [2025-03-08 06:16:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65955 states, 65954 states have (on average 1.2766473602814083) internal successors, (84200), 65954 states have internal predecessors, (84200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65955 states to 65955 states and 84200 transitions. [2025-03-08 06:16:29,920 INFO L78 Accepts]: Start accepts. Automaton has 65955 states and 84200 transitions. Word has length 97 [2025-03-08 06:16:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:29,920 INFO L471 AbstractCegarLoop]: Abstraction has 65955 states and 84200 transitions. [2025-03-08 06:16:29,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 29 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 65955 states and 84200 transitions. [2025-03-08 06:16:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:16:29,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:29,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:29,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:16:30,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 06:16:30,128 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1143244757, now seen corresponding path program 1 times [2025-03-08 06:16:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:30,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278796165] [2025-03-08 06:16:30,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:30,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:16:30,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:16:30,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:30,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:30,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278796165] [2025-03-08 06:16:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278796165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:16:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019303418] [2025-03-08 06:16:30,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:30,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:16:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:30,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:16:30,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:16:30,293 INFO L87 Difference]: Start difference. First operand 65955 states and 84200 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:31,290 INFO L93 Difference]: Finished difference Result 135957 states and 172938 transitions. [2025-03-08 06:16:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:16:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:16:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:31,418 INFO L225 Difference]: With dead ends: 135957 [2025-03-08 06:16:31,418 INFO L226 Difference]: Without dead ends: 109459 [2025-03-08 06:16:31,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:16:31,445 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 777 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:31,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 835 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:16:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109459 states. [2025-03-08 06:16:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109459 to 95943. [2025-03-08 06:16:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95943 states, 95942 states have (on average 1.2756769715036167) internal successors, (122391), 95942 states have internal predecessors, (122391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95943 states to 95943 states and 122391 transitions. [2025-03-08 06:16:32,607 INFO L78 Accepts]: Start accepts. Automaton has 95943 states and 122391 transitions. Word has length 97 [2025-03-08 06:16:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:32,607 INFO L471 AbstractCegarLoop]: Abstraction has 95943 states and 122391 transitions. [2025-03-08 06:16:32,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 95943 states and 122391 transitions. [2025-03-08 06:16:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:16:32,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:32,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:32,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:16:32,617 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:32,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 442636498, now seen corresponding path program 1 times [2025-03-08 06:16:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:32,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218688133] [2025-03-08 06:16:32,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:32,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:16:32,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:16:32,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:32,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218688133] [2025-03-08 06:16:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218688133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:16:32,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941692910] [2025-03-08 06:16:32,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:32,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:16:32,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:16:32,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:16:32,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:16:32,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:16:32,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:16:32,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:32,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:32,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 06:16:32,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:16:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:33,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:16:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941692910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:16:34,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:16:34,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 14] total 30 [2025-03-08 06:16:34,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213048116] [2025-03-08 06:16:34,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:16:34,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:16:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:34,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:16:34,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:16:34,532 INFO L87 Difference]: Start difference. First operand 95943 states and 122391 transitions. Second operand has 30 states, 30 states have (on average 9.1) internal successors, (273), 30 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:51,327 INFO L93 Difference]: Finished difference Result 557281 states and 703110 transitions. [2025-03-08 06:16:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2025-03-08 06:16:51,327 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.1) internal successors, (273), 30 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:16:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:51,993 INFO L225 Difference]: With dead ends: 557281 [2025-03-08 06:16:51,993 INFO L226 Difference]: Without dead ends: 462033 [2025-03-08 06:16:52,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33429 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=8954, Invalid=70852, Unknown=0, NotChecked=0, Total=79806 [2025-03-08 06:16:52,324 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 8404 mSDsluCounter, 10996 mSDsCounter, 0 mSdLazyCounter, 11524 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8404 SdHoareTripleChecker+Valid, 11620 SdHoareTripleChecker+Invalid, 11694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 11524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:52,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8404 Valid, 11620 Invalid, 11694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 11524 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-08 06:16:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462033 states. [2025-03-08 06:16:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462033 to 141001. [2025-03-08 06:16:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141001 states, 141000 states have (on average 1.2733333333333334) internal successors, (179540), 141000 states have internal predecessors, (179540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141001 states to 141001 states and 179540 transitions. [2025-03-08 06:16:55,643 INFO L78 Accepts]: Start accepts. Automaton has 141001 states and 179540 transitions. Word has length 97 [2025-03-08 06:16:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:55,643 INFO L471 AbstractCegarLoop]: Abstraction has 141001 states and 179540 transitions. [2025-03-08 06:16:55,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.1) internal successors, (273), 30 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 141001 states and 179540 transitions. [2025-03-08 06:16:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:16:55,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:55,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:55,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:16:55,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-08 06:16:55,860 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:55,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash 959077854, now seen corresponding path program 1 times [2025-03-08 06:16:55,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:55,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576648422] [2025-03-08 06:16:55,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:55,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:16:55,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:16:55,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:55,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576648422] [2025-03-08 06:16:55,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576648422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:16:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339763231] [2025-03-08 06:16:55,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:55,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:16:55,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:16:55,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:16:55,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:16:55,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:16:56,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:16:56,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:56,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:56,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:16:56,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:16:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:56,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:16:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:56,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339763231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:16:56,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:16:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-08 06:16:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714534181] [2025-03-08 06:16:56,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:16:56,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:16:56,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:56,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:16:56,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:16:56,466 INFO L87 Difference]: Start difference. First operand 141001 states and 179540 transitions. Second operand has 14 states, 14 states have (on average 20.357142857142858) internal successors, (285), 14 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:57,544 INFO L93 Difference]: Finished difference Result 318513 states and 404946 transitions. [2025-03-08 06:16:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:16:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.357142857142858) internal successors, (285), 14 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 06:16:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:57,801 INFO L225 Difference]: With dead ends: 318513 [2025-03-08 06:16:57,801 INFO L226 Difference]: Without dead ends: 178237 [2025-03-08 06:16:57,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:16:57,869 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2028 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:57,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2028 Valid, 692 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:16:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178237 states. [2025-03-08 06:16:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178237 to 149889. [2025-03-08 06:16:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149889 states, 149888 states have (on average 1.2527153608027326) internal successors, (187767), 149888 states have internal predecessors, (187767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149889 states to 149889 states and 187767 transitions. [2025-03-08 06:16:59,979 INFO L78 Accepts]: Start accepts. Automaton has 149889 states and 187767 transitions. Word has length 107 [2025-03-08 06:16:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:59,979 INFO L471 AbstractCegarLoop]: Abstraction has 149889 states and 187767 transitions. [2025-03-08 06:16:59,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.357142857142858) internal successors, (285), 14 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:16:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 149889 states and 187767 transitions. [2025-03-08 06:16:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:16:59,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:59,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:16:59,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:17:00,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:00,197 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:00,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1422509753, now seen corresponding path program 1 times [2025-03-08 06:17:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266370495] [2025-03-08 06:17:00,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:17:00,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:17:00,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:00,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266370495] [2025-03-08 06:17:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266370495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:17:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607168090] [2025-03-08 06:17:00,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:00,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:00,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:00,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:00,254 INFO L87 Difference]: Start difference. First operand 149889 states and 187767 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:01,149 INFO L93 Difference]: Finished difference Result 295057 states and 369146 transitions. [2025-03-08 06:17:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:17:01,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 06:17:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:01,344 INFO L225 Difference]: With dead ends: 295057 [2025-03-08 06:17:01,344 INFO L226 Difference]: Without dead ends: 145909 [2025-03-08 06:17:01,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:17:01,383 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 373 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:01,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 351 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:17:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145909 states. [2025-03-08 06:17:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145909 to 137791. [2025-03-08 06:17:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137791 states, 137790 states have (on average 1.2315407504173017) internal successors, (169694), 137790 states have internal predecessors, (169694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137791 states to 137791 states and 169694 transitions. [2025-03-08 06:17:03,113 INFO L78 Accepts]: Start accepts. Automaton has 137791 states and 169694 transitions. Word has length 107 [2025-03-08 06:17:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:03,114 INFO L471 AbstractCegarLoop]: Abstraction has 137791 states and 169694 transitions. [2025-03-08 06:17:03,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 137791 states and 169694 transitions. [2025-03-08 06:17:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:17:03,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:03,125 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:17:03,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:17:03,126 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:03,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1051917434, now seen corresponding path program 1 times [2025-03-08 06:17:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:03,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973943597] [2025-03-08 06:17:03,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:03,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:17:03,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:17:03,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:03,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973943597] [2025-03-08 06:17:03,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973943597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877964568] [2025-03-08 06:17:03,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:03,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:03,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:03,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:17:03,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:17:03,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:17:03,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:03,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:03,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:17:03,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:03,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:17:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877964568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:17:03,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:17:03,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-08 06:17:03,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514524950] [2025-03-08 06:17:03,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:17:03,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:17:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:03,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:17:03,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:17:03,598 INFO L87 Difference]: Start difference. First operand 137791 states and 169694 transitions. Second operand has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:04,485 INFO L93 Difference]: Finished difference Result 273281 states and 336204 transitions. [2025-03-08 06:17:04,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:17:04,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 06:17:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:04,627 INFO L225 Difference]: With dead ends: 273281 [2025-03-08 06:17:04,627 INFO L226 Difference]: Without dead ends: 136297 [2025-03-08 06:17:04,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:17:04,685 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1154 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:04,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 740 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:17:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136297 states. [2025-03-08 06:17:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136297 to 123355. [2025-03-08 06:17:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123355 states, 123354 states have (on average 1.21070253092725) internal successors, (149345), 123354 states have internal predecessors, (149345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123355 states to 123355 states and 149345 transitions. [2025-03-08 06:17:06,106 INFO L78 Accepts]: Start accepts. Automaton has 123355 states and 149345 transitions. Word has length 107 [2025-03-08 06:17:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:06,106 INFO L471 AbstractCegarLoop]: Abstraction has 123355 states and 149345 transitions. [2025-03-08 06:17:06,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 123355 states and 149345 transitions. [2025-03-08 06:17:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:17:06,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:06,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:17:06,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:17:06,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-08 06:17:06,320 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:06,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1784922206, now seen corresponding path program 1 times [2025-03-08 06:17:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271088111] [2025-03-08 06:17:06,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:06,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:17:06,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:17:06,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:06,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:06,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:06,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271088111] [2025-03-08 06:17:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271088111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:06,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:06,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 06:17:06,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299991819] [2025-03-08 06:17:06,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:06,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 06:17:06,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:06,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 06:17:06,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:17:06,873 INFO L87 Difference]: Start difference. First operand 123355 states and 149345 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:09,640 INFO L93 Difference]: Finished difference Result 192893 states and 231439 transitions. [2025-03-08 06:17:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-08 06:17:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:17:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:09,823 INFO L225 Difference]: With dead ends: 192893 [2025-03-08 06:17:09,823 INFO L226 Difference]: Without dead ends: 174667 [2025-03-08 06:17:09,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=815, Invalid=3475, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 06:17:09,877 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 1957 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:09,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 1912 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:17:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174667 states. [2025-03-08 06:17:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174667 to 123265. [2025-03-08 06:17:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123265 states, 123264 states have (on average 1.2108239226375908) internal successors, (149251), 123264 states have internal predecessors, (149251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123265 states to 123265 states and 149251 transitions. [2025-03-08 06:17:11,484 INFO L78 Accepts]: Start accepts. Automaton has 123265 states and 149251 transitions. Word has length 110 [2025-03-08 06:17:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:11,484 INFO L471 AbstractCegarLoop]: Abstraction has 123265 states and 149251 transitions. [2025-03-08 06:17:11,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 123265 states and 149251 transitions. [2025-03-08 06:17:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:17:11,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:11,494 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:17:11,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:17:11,494 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:11,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2083766792, now seen corresponding path program 1 times [2025-03-08 06:17:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:11,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308595477] [2025-03-08 06:17:11,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:11,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:11,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:17:11,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:17:11,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:11,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308595477] [2025-03-08 06:17:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308595477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338118542] [2025-03-08 06:17:11,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:11,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:11,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:11,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:11,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:17:12,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:17:12,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:17:12,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:12,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:12,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 06:17:12,131 INFO L279 TraceCheckSpWp]: Computing forward predicates...