./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.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 5c7b2e547f39f7d53d20335ecc1b1fbde6acdc52384cb52caa86017352bf317a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:15:27,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:15:27,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:15:27,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:15:27,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:15:27,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:15:27,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:15:27,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:15:27,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:15:27,704 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:15:27,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:15:27,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:15:27,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:15:27,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:15:27,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:15:27,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:15:27,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:15:27,706 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 -> 5c7b2e547f39f7d53d20335ecc1b1fbde6acdc52384cb52caa86017352bf317a [2025-03-03 15:15:27,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:15:27,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:15:27,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:15:27,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:15:27,940 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:15:27,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:15:29,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0c16cf1/cab6401841e04f459a5317c8dece3bb1/FLAG037488d65 [2025-03-03 15:15:29,319 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:15:29,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:15:29,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0c16cf1/cab6401841e04f459a5317c8dece3bb1/FLAG037488d65 [2025-03-03 15:15:29,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0c16cf1/cab6401841e04f459a5317c8dece3bb1 [2025-03-03 15:15:29,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:15:29,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:15:29,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:15:29,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:15:29,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:15:29,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3df4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29, skipping insertion in model container [2025-03-03 15:15:29,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:15:29,540 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.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7834,7847] [2025-03-03 15:15:29,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:15:29,581 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:15:29,614 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.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7834,7847] [2025-03-03 15:15:29,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:15:29,645 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:15:29,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29 WrapperNode [2025-03-03 15:15:29,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:15:29,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:15:29,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:15:29,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:15:29,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,687 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 671 [2025-03-03 15:15:29,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:15:29,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:15:29,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:15:29,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:15:29,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:15:29,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:15:29,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:15:29,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:15:29,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:15:29,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (1/1) ... [2025-03-03 15:15:29,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:15:29,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:15:29,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:15:29,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:15:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:15:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:15:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:15:29,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:15:29,858 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:15:29,860 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:15:30,260 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:30,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:30,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L424: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:15:30,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L474: havoc main_~node4__m4~2#1; [2025-03-03 15:15:30,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~2#1; [2025-03-03 15:15:30,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L459: havoc main_~node3__m3~2#1; [2025-03-03 15:15:30,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: havoc main_~node2__m2~2#1; [2025-03-03 15:15:30,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L660: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:30,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:30,290 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-03-03 15:15:30,290 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:15:30,297 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:15:30,298 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:15:30,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:15:30 BoogieIcfgContainer [2025-03-03 15:15:30,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:15:30,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:15:30,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:15:30,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:15:30,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:15:29" (1/3) ... [2025-03-03 15:15:30,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d7b861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:15:30, skipping insertion in model container [2025-03-03 15:15:30,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:29" (2/3) ... [2025-03-03 15:15:30,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d7b861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:15:30, skipping insertion in model container [2025-03-03 15:15:30,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:15:30" (3/3) ... [2025-03-03 15:15:30,315 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:15:30,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:15:30,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 149 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:15:30,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:15:30,381 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;@3e7af4d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:15:30,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:15:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 148 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:15:30,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:30,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:30,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:30,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1321092320, now seen corresponding path program 1 times [2025-03-03 15:15:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:30,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561605967] [2025-03-03 15:15:30,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:30,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:15:30,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:15:30,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:30,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:30,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561605967] [2025-03-03 15:15:30,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561605967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:30,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:30,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:30,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159908524] [2025-03-03 15:15:30,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:30,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:30,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:30,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:30,901 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 148 states have internal predecessors, (258), 0 states have call successors, (0), 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 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:31,258 INFO L93 Difference]: Finished difference Result 832 states and 1345 transitions. [2025-03-03 15:15:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:15:31,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:15:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:31,274 INFO L225 Difference]: With dead ends: 832 [2025-03-03 15:15:31,274 INFO L226 Difference]: Without dead ends: 750 [2025-03-03 15:15:31,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:15:31,282 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1248 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 3344 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:31,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 3344 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-03 15:15:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 226. [2025-03-03 15:15:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2025-03-03 15:15:31,340 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 75 [2025-03-03 15:15:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:31,341 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2025-03-03 15:15:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2025-03-03 15:15:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:31,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:31,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:31,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:15:31,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:31,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash 665341596, now seen corresponding path program 1 times [2025-03-03 15:15:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:31,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826737835] [2025-03-03 15:15:31,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:31,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:31,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:31,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:31,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:31,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:31,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826737835] [2025-03-03 15:15:31,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826737835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:31,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:31,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980497644] [2025-03-03 15:15:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:31,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:31,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:31,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:31,608 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:31,770 INFO L93 Difference]: Finished difference Result 921 states and 1431 transitions. [2025-03-03 15:15:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:31,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:15:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:31,773 INFO L225 Difference]: With dead ends: 921 [2025-03-03 15:15:31,774 INFO L226 Difference]: Without dead ends: 801 [2025-03-03 15:15:31,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:31,777 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 843 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:31,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1908 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-03 15:15:31,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 360. [2025-03-03 15:15:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5125348189415042) internal successors, (543), 359 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 543 transitions. [2025-03-03 15:15:31,806 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 543 transitions. Word has length 77 [2025-03-03 15:15:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:31,809 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 543 transitions. [2025-03-03 15:15:31,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 543 transitions. [2025-03-03 15:15:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:31,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:31,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:31,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:15:31,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:31,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash -11560540, now seen corresponding path program 1 times [2025-03-03 15:15:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:31,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582214325] [2025-03-03 15:15:31,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:31,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:31,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:31,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:31,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:31,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:31,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582214325] [2025-03-03 15:15:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582214325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038992131] [2025-03-03 15:15:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:31,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:31,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:31,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:31,975 INFO L87 Difference]: Start difference. First operand 360 states and 543 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:32,140 INFO L93 Difference]: Finished difference Result 1055 states and 1645 transitions. [2025-03-03 15:15:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:15:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:32,143 INFO L225 Difference]: With dead ends: 1055 [2025-03-03 15:15:32,144 INFO L226 Difference]: Without dead ends: 935 [2025-03-03 15:15:32,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:32,145 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 834 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:32,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1850 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-03 15:15:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 553. [2025-03-03 15:15:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.5416666666666667) internal successors, (851), 552 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 851 transitions. [2025-03-03 15:15:32,166 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 851 transitions. Word has length 77 [2025-03-03 15:15:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:32,166 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 851 transitions. [2025-03-03 15:15:32,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 851 transitions. [2025-03-03 15:15:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:32,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:32,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:32,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:15:32,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2067491740, now seen corresponding path program 1 times [2025-03-03 15:15:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456727479] [2025-03-03 15:15:32,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:32,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:32,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:32,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:32,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:32,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456727479] [2025-03-03 15:15:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456727479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:32,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:32,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:32,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693594708] [2025-03-03 15:15:32,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:32,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:32,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:32,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:32,356 INFO L87 Difference]: Start difference. First operand 553 states and 851 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:32,495 INFO L93 Difference]: Finished difference Result 1184 states and 1851 transitions. [2025-03-03 15:15:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:32,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:15:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:32,499 INFO L225 Difference]: With dead ends: 1184 [2025-03-03 15:15:32,499 INFO L226 Difference]: Without dead ends: 1064 [2025-03-03 15:15:32,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:32,503 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 924 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:32,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1614 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-03 15:15:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 682. [2025-03-03 15:15:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.552129221732746) internal successors, (1057), 681 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1057 transitions. [2025-03-03 15:15:32,526 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1057 transitions. Word has length 77 [2025-03-03 15:15:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:32,526 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1057 transitions. [2025-03-03 15:15:32,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1057 transitions. [2025-03-03 15:15:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:32,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:32,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:32,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:15:32,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:32,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash -925262684, now seen corresponding path program 1 times [2025-03-03 15:15:32,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:32,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958120208] [2025-03-03 15:15:32,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:32,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:32,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:32,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:32,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:32,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:32,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958120208] [2025-03-03 15:15:32,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958120208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:32,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:32,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101140862] [2025-03-03 15:15:32,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:32,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:32,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:32,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:32,667 INFO L87 Difference]: Start difference. First operand 682 states and 1057 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:32,804 INFO L93 Difference]: Finished difference Result 1308 states and 2049 transitions. [2025-03-03 15:15:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:32,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:15:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:32,808 INFO L225 Difference]: With dead ends: 1308 [2025-03-03 15:15:32,808 INFO L226 Difference]: Without dead ends: 1188 [2025-03-03 15:15:32,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:32,810 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1013 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:32,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1535 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-03 15:15:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 806. [2025-03-03 15:15:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.5590062111801242) internal successors, (1255), 805 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1255 transitions. [2025-03-03 15:15:32,828 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1255 transitions. Word has length 77 [2025-03-03 15:15:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:32,828 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1255 transitions. [2025-03-03 15:15:32,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1255 transitions. [2025-03-03 15:15:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:32,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:32,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:32,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:15:32,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:32,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:32,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1319651484, now seen corresponding path program 1 times [2025-03-03 15:15:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:32,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121325299] [2025-03-03 15:15:32,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:32,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:32,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:32,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:32,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:32,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121325299] [2025-03-03 15:15:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121325299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:32,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008183293] [2025-03-03 15:15:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:32,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:32,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:32,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:32,963 INFO L87 Difference]: Start difference. First operand 806 states and 1255 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:33,096 INFO L93 Difference]: Finished difference Result 1427 states and 2239 transitions. [2025-03-03 15:15:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:15:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:33,101 INFO L225 Difference]: With dead ends: 1427 [2025-03-03 15:15:33,102 INFO L226 Difference]: Without dead ends: 1307 [2025-03-03 15:15:33,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:33,103 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1098 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:33,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1611 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-03-03 15:15:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 925. [2025-03-03 15:15:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.5638528138528138) internal successors, (1445), 924 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1445 transitions. [2025-03-03 15:15:33,124 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1445 transitions. Word has length 77 [2025-03-03 15:15:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:33,124 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1445 transitions. [2025-03-03 15:15:33,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1445 transitions. [2025-03-03 15:15:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:33,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:33,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:33,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:15:33,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:33,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1701593687, now seen corresponding path program 1 times [2025-03-03 15:15:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695915393] [2025-03-03 15:15:33,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:33,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:33,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:33,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:33,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695915393] [2025-03-03 15:15:33,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695915393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:33,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:33,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:33,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352112410] [2025-03-03 15:15:33,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:33,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:33,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:33,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:33,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:33,210 INFO L87 Difference]: Start difference. First operand 925 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:33,241 INFO L93 Difference]: Finished difference Result 2379 states and 3757 transitions. [2025-03-03 15:15:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:15:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:33,245 INFO L225 Difference]: With dead ends: 2379 [2025-03-03 15:15:33,245 INFO L226 Difference]: Without dead ends: 1610 [2025-03-03 15:15:33,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:33,246 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 83 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:33,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 467 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-03-03 15:15:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1582. [2025-03-03 15:15:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5566097406704618) internal successors, (2461), 1581 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2461 transitions. [2025-03-03 15:15:33,269 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2461 transitions. Word has length 77 [2025-03-03 15:15:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:33,270 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2461 transitions. [2025-03-03 15:15:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2461 transitions. [2025-03-03 15:15:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:33,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:33,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:33,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:15:33,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:33,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1700431838, now seen corresponding path program 1 times [2025-03-03 15:15:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795932680] [2025-03-03 15:15:33,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:33,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:33,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:33,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:33,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:33,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:33,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795932680] [2025-03-03 15:15:33,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795932680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:33,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026258497] [2025-03-03 15:15:33,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:33,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:33,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:33,493 INFO L87 Difference]: Start difference. First operand 1582 states and 2461 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:33,635 INFO L93 Difference]: Finished difference Result 3010 states and 4708 transitions. [2025-03-03 15:15:33,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:33,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:15:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:33,639 INFO L225 Difference]: With dead ends: 3010 [2025-03-03 15:15:33,639 INFO L226 Difference]: Without dead ends: 1584 [2025-03-03 15:15:33,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:15:33,641 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 372 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:33,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 681 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-03 15:15:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1582. [2025-03-03 15:15:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2454 transitions. [2025-03-03 15:15:33,662 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2454 transitions. Word has length 77 [2025-03-03 15:15:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:33,662 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2454 transitions. [2025-03-03 15:15:33,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2454 transitions. [2025-03-03 15:15:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:15:33,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:33,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:33,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:15:33,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:33,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:33,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1205024287, now seen corresponding path program 1 times [2025-03-03 15:15:33,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:33,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315010435] [2025-03-03 15:15:33,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:33,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:33,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:15:33,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:15:33,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:33,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:33,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315010435] [2025-03-03 15:15:33,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315010435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:33,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:33,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064945281] [2025-03-03 15:15:33,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:33,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:33,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:33,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:33,740 INFO L87 Difference]: Start difference. First operand 1582 states and 2454 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:33,840 INFO L93 Difference]: Finished difference Result 3127 states and 4870 transitions. [2025-03-03 15:15:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:33,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:15:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:33,844 INFO L225 Difference]: With dead ends: 3127 [2025-03-03 15:15:33,844 INFO L226 Difference]: Without dead ends: 1582 [2025-03-03 15:15:33,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:33,846 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 555 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:33,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 111 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-03 15:15:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2025-03-03 15:15:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5351043643263758) internal successors, (2427), 1581 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2427 transitions. [2025-03-03 15:15:33,868 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2427 transitions. Word has length 78 [2025-03-03 15:15:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:33,868 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2427 transitions. [2025-03-03 15:15:33,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2427 transitions. [2025-03-03 15:15:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:33,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:33,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:33,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:15:33,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:33,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash 800100157, now seen corresponding path program 1 times [2025-03-03 15:15:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:33,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093323974] [2025-03-03 15:15:33,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:33,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:33,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:33,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:33,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:33,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:33,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093323974] [2025-03-03 15:15:33,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093323974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:33,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:33,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618092450] [2025-03-03 15:15:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:33,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:33,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:33,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:33,963 INFO L87 Difference]: Start difference. First operand 1582 states and 2427 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:34,068 INFO L93 Difference]: Finished difference Result 3115 states and 4802 transitions. [2025-03-03 15:15:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:34,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:15:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:34,073 INFO L225 Difference]: With dead ends: 3115 [2025-03-03 15:15:34,073 INFO L226 Difference]: Without dead ends: 1582 [2025-03-03 15:15:34,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:34,075 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 515 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:34,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 135 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-03 15:15:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2025-03-03 15:15:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5180265654648957) internal successors, (2400), 1581 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2400 transitions. [2025-03-03 15:15:34,103 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2400 transitions. Word has length 79 [2025-03-03 15:15:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:34,104 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2400 transitions. [2025-03-03 15:15:34,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2400 transitions. [2025-03-03 15:15:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:15:34,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:34,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:34,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:15:34,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:34,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:34,105 INFO L85 PathProgramCache]: Analyzing trace with hash -716761339, now seen corresponding path program 1 times [2025-03-03 15:15:34,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:34,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518208671] [2025-03-03 15:15:34,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:34,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:34,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:15:34,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:15:34,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:34,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:34,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:34,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518208671] [2025-03-03 15:15:34,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518208671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:34,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:34,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119299322] [2025-03-03 15:15:34,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:34,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:34,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:34,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:34,192 INFO L87 Difference]: Start difference. First operand 1582 states and 2400 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:34,286 INFO L93 Difference]: Finished difference Result 3111 states and 4744 transitions. [2025-03-03 15:15:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 15:15:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:34,291 INFO L225 Difference]: With dead ends: 3111 [2025-03-03 15:15:34,291 INFO L226 Difference]: Without dead ends: 1582 [2025-03-03 15:15:34,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:34,293 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 497 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:34,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 143 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-03 15:15:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2025-03-03 15:15:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5009487666034156) internal successors, (2373), 1581 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2373 transitions. [2025-03-03 15:15:34,316 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2373 transitions. Word has length 80 [2025-03-03 15:15:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:34,316 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2373 transitions. [2025-03-03 15:15:34,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2373 transitions. [2025-03-03 15:15:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:15:34,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:34,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:34,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:15:34,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:34,318 INFO L85 PathProgramCache]: Analyzing trace with hash -556405863, now seen corresponding path program 1 times [2025-03-03 15:15:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136553998] [2025-03-03 15:15:34,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:34,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:34,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:15:34,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:15:34,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:34,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:34,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136553998] [2025-03-03 15:15:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136553998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:34,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:34,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:34,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755314972] [2025-03-03 15:15:34,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:34,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:34,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:34,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:34,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:34,409 INFO L87 Difference]: Start difference. First operand 1582 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:34,499 INFO L93 Difference]: Finished difference Result 3123 states and 4704 transitions. [2025-03-03 15:15:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:34,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 15:15:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:34,504 INFO L225 Difference]: With dead ends: 3123 [2025-03-03 15:15:34,504 INFO L226 Difference]: Without dead ends: 1582 [2025-03-03 15:15:34,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:34,506 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 525 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:34,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 119 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-03 15:15:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2025-03-03 15:15:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4838709677419355) internal successors, (2346), 1581 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2346 transitions. [2025-03-03 15:15:34,529 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2346 transitions. Word has length 81 [2025-03-03 15:15:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:34,529 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2346 transitions. [2025-03-03 15:15:34,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2346 transitions. [2025-03-03 15:15:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:15:34,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:34,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:15:34,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:34,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash 740361185, now seen corresponding path program 1 times [2025-03-03 15:15:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:34,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946468562] [2025-03-03 15:15:34,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:34,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:15:34,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:15:34,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:34,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:34,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:34,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946468562] [2025-03-03 15:15:34,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946468562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:34,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:34,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15608907] [2025-03-03 15:15:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:34,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:34,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:34,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:34,612 INFO L87 Difference]: Start difference. First operand 1582 states and 2346 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:34,699 INFO L93 Difference]: Finished difference Result 3119 states and 4646 transitions. [2025-03-03 15:15:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:34,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 15:15:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:34,704 INFO L225 Difference]: With dead ends: 3119 [2025-03-03 15:15:34,704 INFO L226 Difference]: Without dead ends: 1582 [2025-03-03 15:15:34,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:34,706 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 507 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:34,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 127 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-03 15:15:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2025-03-03 15:15:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4667931688804554) internal successors, (2319), 1581 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2319 transitions. [2025-03-03 15:15:34,726 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2319 transitions. Word has length 82 [2025-03-03 15:15:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:34,726 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2319 transitions. [2025-03-03 15:15:34,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2319 transitions. [2025-03-03 15:15:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:15:34,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:34,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:34,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:15:34,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1340982283, now seen corresponding path program 1 times [2025-03-03 15:15:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:34,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909031426] [2025-03-03 15:15:34,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:34,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:15:34,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:15:34,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:34,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:35,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:35,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909031426] [2025-03-03 15:15:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909031426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:35,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697523654] [2025-03-03 15:15:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:35,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:35,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:35,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:35,005 INFO L87 Difference]: Start difference. First operand 1582 states and 2319 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:35,297 INFO L93 Difference]: Finished difference Result 4506 states and 6645 transitions. [2025-03-03 15:15:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:15:35,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-03 15:15:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:35,305 INFO L225 Difference]: With dead ends: 4506 [2025-03-03 15:15:35,305 INFO L226 Difference]: Without dead ends: 3014 [2025-03-03 15:15:35,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:15:35,307 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 982 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:35,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 459 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2025-03-03 15:15:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1582. [2025-03-03 15:15:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4661606578115116) internal successors, (2318), 1581 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2318 transitions. [2025-03-03 15:15:35,336 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2318 transitions. Word has length 83 [2025-03-03 15:15:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:35,336 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2318 transitions. [2025-03-03 15:15:35,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2318 transitions. [2025-03-03 15:15:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:15:35,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:35,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:35,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:15:35,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:35,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1795033165, now seen corresponding path program 1 times [2025-03-03 15:15:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:35,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400499752] [2025-03-03 15:15:35,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:35,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:15:35,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:15:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:35,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400499752] [2025-03-03 15:15:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400499752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:35,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:35,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:15:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257321402] [2025-03-03 15:15:35,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:35,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:15:35,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:35,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:15:35,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:15:35,757 INFO L87 Difference]: Start difference. First operand 1582 states and 2318 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:36,281 INFO L93 Difference]: Finished difference Result 4631 states and 6775 transitions. [2025-03-03 15:15:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:15:36,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-03 15:15:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:36,289 INFO L225 Difference]: With dead ends: 4631 [2025-03-03 15:15:36,289 INFO L226 Difference]: Without dead ends: 3200 [2025-03-03 15:15:36,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:15:36,291 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 833 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:36,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 769 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2025-03-03 15:15:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 1627. [2025-03-03 15:15:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 1.464329643296433) internal successors, (2381), 1626 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2381 transitions. [2025-03-03 15:15:36,321 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2381 transitions. Word has length 84 [2025-03-03 15:15:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:36,322 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 2381 transitions. [2025-03-03 15:15:36,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2381 transitions. [2025-03-03 15:15:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:15:36,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:36,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:36,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:15:36,323 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:36,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1252455628, now seen corresponding path program 1 times [2025-03-03 15:15:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:36,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920218248] [2025-03-03 15:15:36,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:36,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:36,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:15:36,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:15:36,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:36,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:36,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:36,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920218248] [2025-03-03 15:15:36,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920218248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:36,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:36,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:15:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035120175] [2025-03-03 15:15:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:36,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:15:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:36,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:15:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:15:36,549 INFO L87 Difference]: Start difference. First operand 1627 states and 2381 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:36,880 INFO L93 Difference]: Finished difference Result 4580 states and 6715 transitions. [2025-03-03 15:15:36,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:36,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-03 15:15:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:36,890 INFO L225 Difference]: With dead ends: 4580 [2025-03-03 15:15:36,890 INFO L226 Difference]: Without dead ends: 3148 [2025-03-03 15:15:36,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:15:36,894 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 771 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:36,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 511 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2025-03-03 15:15:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 1582. [2025-03-03 15:15:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4623655913978495) internal successors, (2312), 1581 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2312 transitions. [2025-03-03 15:15:36,922 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2312 transitions. Word has length 84 [2025-03-03 15:15:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:36,922 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2312 transitions. [2025-03-03 15:15:36,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2312 transitions. [2025-03-03 15:15:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:15:36,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:36,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:36,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:15:36,923 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:36,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:36,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1711299644, now seen corresponding path program 1 times [2025-03-03 15:15:36,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:36,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891998932] [2025-03-03 15:15:36,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:36,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:15:36,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:15:36,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:36,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891998932] [2025-03-03 15:15:37,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891998932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:37,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:37,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:15:37,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050375627] [2025-03-03 15:15:37,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:37,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:15:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:37,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:15:37,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:15:37,226 INFO L87 Difference]: Start difference. First operand 1582 states and 2312 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:37,683 INFO L93 Difference]: Finished difference Result 4640 states and 6780 transitions. [2025-03-03 15:15:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:15:37,686 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-03 15:15:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:37,691 INFO L225 Difference]: With dead ends: 4640 [2025-03-03 15:15:37,691 INFO L226 Difference]: Without dead ends: 3179 [2025-03-03 15:15:37,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:15:37,693 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 683 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:37,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 762 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2025-03-03 15:15:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 1588. [2025-03-03 15:15:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 1.4606175173282925) internal successors, (2318), 1587 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2318 transitions. [2025-03-03 15:15:37,715 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2318 transitions. Word has length 84 [2025-03-03 15:15:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:37,715 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2318 transitions. [2025-03-03 15:15:37,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2318 transitions. [2025-03-03 15:15:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:15:37,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:37,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:37,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:15:37,717 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:37,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash -946992268, now seen corresponding path program 1 times [2025-03-03 15:15:37,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:37,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333175824] [2025-03-03 15:15:37,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:37,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:37,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:15:37,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:15:37,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:37,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:37,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:37,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333175824] [2025-03-03 15:15:37,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333175824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:37,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:37,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:15:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703903408] [2025-03-03 15:15:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:37,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:15:37,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:37,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:15:37,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:15:37,953 INFO L87 Difference]: Start difference. First operand 1588 states and 2318 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:38,341 INFO L93 Difference]: Finished difference Result 4604 states and 6750 transitions. [2025-03-03 15:15:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:15:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:38,351 INFO L225 Difference]: With dead ends: 4604 [2025-03-03 15:15:38,351 INFO L226 Difference]: Without dead ends: 3127 [2025-03-03 15:15:38,353 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-03 15:15:38,354 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 884 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:38,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 634 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2025-03-03 15:15:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1582. [2025-03-03 15:15:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4598355471220745) internal successors, (2308), 1581 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2308 transitions. [2025-03-03 15:15:38,377 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2308 transitions. Word has length 85 [2025-03-03 15:15:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:38,378 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2308 transitions. [2025-03-03 15:15:38,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2308 transitions. [2025-03-03 15:15:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:15:38,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:38,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:38,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:15:38,379 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:38,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -137543828, now seen corresponding path program 1 times [2025-03-03 15:15:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:38,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041987712] [2025-03-03 15:15:38,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:38,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:15:38,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:15:38,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:38,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:38,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041987712] [2025-03-03 15:15:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041987712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:38,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:38,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227638625] [2025-03-03 15:15:38,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:38,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:38,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:38,739 INFO L87 Difference]: Start difference. First operand 1582 states and 2308 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:39,484 INFO L93 Difference]: Finished difference Result 5575 states and 8164 transitions. [2025-03-03 15:15:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:15:39,484 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:15:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:39,489 INFO L225 Difference]: With dead ends: 5575 [2025-03-03 15:15:39,489 INFO L226 Difference]: Without dead ends: 4088 [2025-03-03 15:15:39,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:15:39,491 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 709 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:39,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1317 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:15:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2025-03-03 15:15:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 1582. [2025-03-03 15:15:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4585705249841872) internal successors, (2306), 1581 states have internal predecessors, (2306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2306 transitions. [2025-03-03 15:15:39,511 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2306 transitions. Word has length 85 [2025-03-03 15:15:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:39,511 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2306 transitions. [2025-03-03 15:15:39,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2306 transitions. [2025-03-03 15:15:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:15:39,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:39,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:39,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:15:39,512 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:39,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash -395328788, now seen corresponding path program 1 times [2025-03-03 15:15:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368588876] [2025-03-03 15:15:39,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:39,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:15:39,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:15:39,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:39,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:39,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368588876] [2025-03-03 15:15:39,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368588876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:39,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:39,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:15:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301495210] [2025-03-03 15:15:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:39,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:15:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:39,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:15:39,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:15:39,705 INFO L87 Difference]: Start difference. First operand 1582 states and 2306 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:40,090 INFO L93 Difference]: Finished difference Result 4568 states and 6690 transitions. [2025-03-03 15:15:40,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:40,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-03 15:15:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:40,094 INFO L225 Difference]: With dead ends: 4568 [2025-03-03 15:15:40,094 INFO L226 Difference]: Without dead ends: 3111 [2025-03-03 15:15:40,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:15:40,096 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 564 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:40,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 793 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-03-03 15:15:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 1582. [2025-03-03 15:15:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4554079696394686) internal successors, (2301), 1581 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2301 transitions. [2025-03-03 15:15:40,118 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2301 transitions. Word has length 86 [2025-03-03 15:15:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:40,118 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2301 transitions. [2025-03-03 15:15:40,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2301 transitions. [2025-03-03 15:15:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:15:40,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:40,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:40,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:15:40,120 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:40,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1255055948, now seen corresponding path program 1 times [2025-03-03 15:15:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:40,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406792778] [2025-03-03 15:15:40,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:40,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:40,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:15:40,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:15:40,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:40,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:40,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:40,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406792778] [2025-03-03 15:15:40,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406792778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:40,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:40,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:15:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801796974] [2025-03-03 15:15:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:40,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:15:40,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:40,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:15:40,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:40,631 INFO L87 Difference]: Start difference. First operand 1582 states and 2301 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:41,153 INFO L93 Difference]: Finished difference Result 3479 states and 5102 transitions. [2025-03-03 15:15:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:15:41,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:15:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:41,157 INFO L225 Difference]: With dead ends: 3479 [2025-03-03 15:15:41,158 INFO L226 Difference]: Without dead ends: 3037 [2025-03-03 15:15:41,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:15:41,159 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 822 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:41,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1356 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3037 states. [2025-03-03 15:15:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3037 to 1581. [2025-03-03 15:15:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 1.4518987341772152) internal successors, (2294), 1580 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2294 transitions. [2025-03-03 15:15:41,185 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2294 transitions. Word has length 87 [2025-03-03 15:15:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:41,185 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2294 transitions. [2025-03-03 15:15:41,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2294 transitions. [2025-03-03 15:15:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:15:41,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:41,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:41,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:15:41,187 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:41,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1066636980, now seen corresponding path program 1 times [2025-03-03 15:15:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:41,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501487616] [2025-03-03 15:15:41,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:41,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:41,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:15:41,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:15:41,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:41,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:41,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501487616] [2025-03-03 15:15:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501487616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:15:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696074385] [2025-03-03 15:15:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:41,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:15:41,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:41,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:15:41,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:41,620 INFO L87 Difference]: Start difference. First operand 1581 states and 2294 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:42,093 INFO L93 Difference]: Finished difference Result 3502 states and 5124 transitions. [2025-03-03 15:15:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:15:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:15:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:42,100 INFO L225 Difference]: With dead ends: 3502 [2025-03-03 15:15:42,100 INFO L226 Difference]: Without dead ends: 3040 [2025-03-03 15:15:42,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:15:42,102 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 990 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:42,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1231 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2025-03-03 15:15:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 1570. [2025-03-03 15:15:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1569 states have (on average 1.4506054811982154) internal successors, (2276), 1569 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2276 transitions. [2025-03-03 15:15:42,120 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2276 transitions. Word has length 87 [2025-03-03 15:15:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:42,121 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2276 transitions. [2025-03-03 15:15:42,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2276 transitions. [2025-03-03 15:15:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:15:42,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:42,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:42,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:15:42,121 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:42,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1414267764, now seen corresponding path program 1 times [2025-03-03 15:15:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:42,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533444553] [2025-03-03 15:15:42,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:42,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:42,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:15:42,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:15:42,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:42,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:42,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:42,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533444553] [2025-03-03 15:15:42,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533444553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:42,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:42,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:15:42,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426528640] [2025-03-03 15:15:42,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:42,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:15:42,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:42,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:15:42,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:15:42,607 INFO L87 Difference]: Start difference. First operand 1570 states and 2276 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:43,203 INFO L93 Difference]: Finished difference Result 6387 states and 9376 transitions. [2025-03-03 15:15:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:15:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:15:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:43,211 INFO L225 Difference]: With dead ends: 6387 [2025-03-03 15:15:43,211 INFO L226 Difference]: Without dead ends: 5915 [2025-03-03 15:15:43,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:15:43,213 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 989 mSDsluCounter, 2441 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:43,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 2750 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2025-03-03 15:15:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 1544. [2025-03-03 15:15:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.4523655217109528) internal successors, (2241), 1543 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2241 transitions. [2025-03-03 15:15:43,256 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2241 transitions. Word has length 87 [2025-03-03 15:15:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:43,256 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2241 transitions. [2025-03-03 15:15:43,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2241 transitions. [2025-03-03 15:15:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:15:43,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:43,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:43,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:15:43,257 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:43,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1560431004, now seen corresponding path program 1 times [2025-03-03 15:15:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:43,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115613713] [2025-03-03 15:15:43,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:43,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:15:43,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:15:43,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:43,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:44,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115613713] [2025-03-03 15:15:44,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115613713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:44,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:44,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 15:15:44,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567640794] [2025-03-03 15:15:44,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:44,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 15:15:44,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:44,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 15:15:44,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:15:44,063 INFO L87 Difference]: Start difference. First operand 1544 states and 2241 transitions. Second operand has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:45,321 INFO L93 Difference]: Finished difference Result 4889 states and 7174 transitions. [2025-03-03 15:15:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 15:15:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:15:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:45,327 INFO L225 Difference]: With dead ends: 4889 [2025-03-03 15:15:45,327 INFO L226 Difference]: Without dead ends: 4447 [2025-03-03 15:15:45,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 15:15:45,329 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1564 mSDsluCounter, 2897 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:45,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 3156 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:15:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2025-03-03 15:15:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 1562. [2025-03-03 15:15:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1561 states have (on average 1.4490711082639334) internal successors, (2262), 1561 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2262 transitions. [2025-03-03 15:15:45,351 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2262 transitions. Word has length 87 [2025-03-03 15:15:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:45,352 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2262 transitions. [2025-03-03 15:15:45,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2262 transitions. [2025-03-03 15:15:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:15:45,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:45,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:45,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:15:45,353 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:45,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash 555228829, now seen corresponding path program 1 times [2025-03-03 15:15:45,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:45,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393139709] [2025-03-03 15:15:45,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:45,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:15:45,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:15:45,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:45,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:45,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:45,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393139709] [2025-03-03 15:15:45,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393139709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:45,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:45,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:45,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25395802] [2025-03-03 15:15:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:45,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:15:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:45,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:15:45,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:15:45,438 INFO L87 Difference]: Start difference. First operand 1562 states and 2262 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:45,470 INFO L93 Difference]: Finished difference Result 3686 states and 5407 transitions. [2025-03-03 15:15:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:45,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 15:15:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:45,473 INFO L225 Difference]: With dead ends: 3686 [2025-03-03 15:15:45,473 INFO L226 Difference]: Without dead ends: 2260 [2025-03-03 15:15:45,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:45,475 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 89 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:45,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 433 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2025-03-03 15:15:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2245. [2025-03-03 15:15:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 2244 states have (on average 1.4487522281639929) internal successors, (3251), 2244 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3251 transitions. [2025-03-03 15:15:45,506 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3251 transitions. Word has length 88 [2025-03-03 15:15:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:45,506 INFO L471 AbstractCegarLoop]: Abstraction has 2245 states and 3251 transitions. [2025-03-03 15:15:45,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3251 transitions. [2025-03-03 15:15:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:15:45,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:45,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:45,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:15:45,508 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:45,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash 587432900, now seen corresponding path program 1 times [2025-03-03 15:15:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708841281] [2025-03-03 15:15:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:45,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:15:45,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:15:45,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:45,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:45,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:45,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708841281] [2025-03-03 15:15:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708841281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:45,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:45,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:15:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439721520] [2025-03-03 15:15:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:45,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:45,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:45,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:45,638 INFO L87 Difference]: Start difference. First operand 2245 states and 3251 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:45,656 INFO L93 Difference]: Finished difference Result 2259 states and 3270 transitions. [2025-03-03 15:15:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 15:15:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:45,659 INFO L225 Difference]: With dead ends: 2259 [2025-03-03 15:15:45,659 INFO L226 Difference]: Without dead ends: 2257 [2025-03-03 15:15:45,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:45,660 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:45,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 713 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-03 15:15:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-03-03 15:15:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.440159574468085) internal successors, (3249), 2256 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3249 transitions. [2025-03-03 15:15:45,675 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3249 transitions. Word has length 88 [2025-03-03 15:15:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:45,676 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3249 transitions. [2025-03-03 15:15:45,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3249 transitions. [2025-03-03 15:15:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:15:45,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:45,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:45,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:15:45,677 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:45,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1180432270, now seen corresponding path program 1 times [2025-03-03 15:15:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:45,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139432559] [2025-03-03 15:15:45,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:45,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:45,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:15:45,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:15:45,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:45,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:47,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139432559] [2025-03-03 15:15:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139432559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:47,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2025-03-03 15:15:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548490898] [2025-03-03 15:15:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 15:15:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:47,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 15:15:47,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 15:15:47,221 INFO L87 Difference]: Start difference. First operand 2257 states and 3249 transitions. Second operand has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:51,007 INFO L93 Difference]: Finished difference Result 13534 states and 19682 transitions. [2025-03-03 15:15:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-03 15:15:51,007 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 15:15:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:51,021 INFO L225 Difference]: With dead ends: 13534 [2025-03-03 15:15:51,022 INFO L226 Difference]: Without dead ends: 12879 [2025-03-03 15:15:51,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=559, Invalid=3101, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 15:15:51,026 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1293 mSDsluCounter, 7727 mSDsCounter, 0 mSdLazyCounter, 5208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 8190 SdHoareTripleChecker+Invalid, 5220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:51,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 8190 Invalid, 5220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5208 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 15:15:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12879 states. [2025-03-03 15:15:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12879 to 2274. [2025-03-03 15:15:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2273 states have (on average 1.438627364716234) internal successors, (3270), 2273 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3270 transitions. [2025-03-03 15:15:51,093 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3270 transitions. Word has length 88 [2025-03-03 15:15:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:51,093 INFO L471 AbstractCegarLoop]: Abstraction has 2274 states and 3270 transitions. [2025-03-03 15:15:51,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3270 transitions. [2025-03-03 15:15:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:15:51,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:51,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:51,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:15:51,094 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:51,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1427211746, now seen corresponding path program 1 times [2025-03-03 15:15:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681480885] [2025-03-03 15:15:51,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:51,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:15:51,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:15:51,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:51,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:51,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:51,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681480885] [2025-03-03 15:15:51,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681480885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:51,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:51,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612972535] [2025-03-03 15:15:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:51,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:15:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:51,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:15:51,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:51,412 INFO L87 Difference]: Start difference. First operand 2274 states and 3270 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:51,710 INFO L93 Difference]: Finished difference Result 4841 states and 7022 transitions. [2025-03-03 15:15:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:15:51,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 15:15:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:51,715 INFO L225 Difference]: With dead ends: 4841 [2025-03-03 15:15:51,716 INFO L226 Difference]: Without dead ends: 4142 [2025-03-03 15:15:51,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:15:51,717 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 619 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:51,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1091 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2025-03-03 15:15:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 2124. [2025-03-03 15:15:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2123 states have (on average 1.4432406971267076) internal successors, (3064), 2123 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 3064 transitions. [2025-03-03 15:15:51,740 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 3064 transitions. Word has length 88 [2025-03-03 15:15:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:51,740 INFO L471 AbstractCegarLoop]: Abstraction has 2124 states and 3064 transitions. [2025-03-03 15:15:51,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 3064 transitions. [2025-03-03 15:15:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:15:51,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:51,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:51,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:15:51,741 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:51,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash -56817520, now seen corresponding path program 1 times [2025-03-03 15:15:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127557810] [2025-03-03 15:15:51,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:51,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:15:51,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:15:51,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:51,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:52,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127557810] [2025-03-03 15:15:52,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127557810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:52,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:52,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:15:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052056169] [2025-03-03 15:15:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:52,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:15:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:52,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:15:52,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:52,103 INFO L87 Difference]: Start difference. First operand 2124 states and 3064 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:52,525 INFO L93 Difference]: Finished difference Result 4805 states and 6979 transitions. [2025-03-03 15:15:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:15:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 15:15:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:52,532 INFO L225 Difference]: With dead ends: 4805 [2025-03-03 15:15:52,532 INFO L226 Difference]: Without dead ends: 4141 [2025-03-03 15:15:52,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:15:52,539 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 586 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:52,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1923 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2025-03-03 15:15:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 2101. [2025-03-03 15:15:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 2100 states have (on average 1.4452380952380952) internal successors, (3035), 2100 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 3035 transitions. [2025-03-03 15:15:52,563 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 3035 transitions. Word has length 89 [2025-03-03 15:15:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:52,564 INFO L471 AbstractCegarLoop]: Abstraction has 2101 states and 3035 transitions. [2025-03-03 15:15:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 3035 transitions. [2025-03-03 15:15:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:15:52,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:52,565 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:52,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:15:52,565 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:52,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash 134514586, now seen corresponding path program 1 times [2025-03-03 15:15:52,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:52,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245421285] [2025-03-03 15:15:52,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:52,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:52,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:15:52,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:15:52,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:52,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:52,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:52,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245421285] [2025-03-03 15:15:52,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245421285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:52,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:52,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:15:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945843877] [2025-03-03 15:15:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:52,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:52,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:52,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:52,654 INFO L87 Difference]: Start difference. First operand 2101 states and 3035 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:52,880 INFO L93 Difference]: Finished difference Result 6919 states and 10149 transitions. [2025-03-03 15:15:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:15:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 15:15:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:52,885 INFO L225 Difference]: With dead ends: 6919 [2025-03-03 15:15:52,885 INFO L226 Difference]: Without dead ends: 4903 [2025-03-03 15:15:52,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:52,888 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 787 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:52,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 437 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4903 states. [2025-03-03 15:15:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4903 to 3191. [2025-03-03 15:15:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 3190 states have (on average 1.4492163009404389) internal successors, (4623), 3190 states have internal predecessors, (4623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4623 transitions. [2025-03-03 15:15:52,917 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4623 transitions. Word has length 116 [2025-03-03 15:15:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:52,918 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 4623 transitions. [2025-03-03 15:15:52,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4623 transitions. [2025-03-03 15:15:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:15:52,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:52,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:52,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:15:52,919 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:52,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2145085734, now seen corresponding path program 1 times [2025-03-03 15:15:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:52,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053583961] [2025-03-03 15:15:52,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:52,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:15:52,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:15:52,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:52,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:53,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:53,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053583961] [2025-03-03 15:15:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053583961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:53,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:15:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394019728] [2025-03-03 15:15:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:53,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:53,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:53,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:53,011 INFO L87 Difference]: Start difference. First operand 3191 states and 4623 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:53,210 INFO L93 Difference]: Finished difference Result 12367 states and 18145 transitions. [2025-03-03 15:15:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:15:53,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 15:15:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:53,218 INFO L225 Difference]: With dead ends: 12367 [2025-03-03 15:15:53,218 INFO L226 Difference]: Without dead ends: 9279 [2025-03-03 15:15:53,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:53,222 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 1012 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:53,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 344 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2025-03-03 15:15:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 6777. [2025-03-03 15:15:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6777 states, 6776 states have (on average 1.451151121605667) internal successors, (9833), 6776 states have internal predecessors, (9833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6777 states to 6777 states and 9833 transitions. [2025-03-03 15:15:53,286 INFO L78 Accepts]: Start accepts. Automaton has 6777 states and 9833 transitions. Word has length 116 [2025-03-03 15:15:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:53,287 INFO L471 AbstractCegarLoop]: Abstraction has 6777 states and 9833 transitions. [2025-03-03 15:15:53,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6777 states and 9833 transitions. [2025-03-03 15:15:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:15:53,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:53,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:53,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:15:53,288 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:53,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1990223354, now seen corresponding path program 1 times [2025-03-03 15:15:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254561946] [2025-03-03 15:15:53,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:53,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:15:53,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:15:53,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:53,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254561946] [2025-03-03 15:15:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254561946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:53,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:53,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:15:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390671908] [2025-03-03 15:15:53,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:53,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:53,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:53,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:53,366 INFO L87 Difference]: Start difference. First operand 6777 states and 9833 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:53,587 INFO L93 Difference]: Finished difference Result 24125 states and 35275 transitions. [2025-03-03 15:15:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:15:53,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 15:15:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:53,604 INFO L225 Difference]: With dead ends: 24125 [2025-03-03 15:15:53,605 INFO L226 Difference]: Without dead ends: 17451 [2025-03-03 15:15:53,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:53,614 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 927 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:53,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 342 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17451 states. [2025-03-03 15:15:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17451 to 14449. [2025-03-03 15:15:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14449 states, 14448 states have (on average 1.450235326688815) internal successors, (20953), 14448 states have internal predecessors, (20953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14449 states to 14449 states and 20953 transitions. [2025-03-03 15:15:53,781 INFO L78 Accepts]: Start accepts. Automaton has 14449 states and 20953 transitions. Word has length 116 [2025-03-03 15:15:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:53,781 INFO L471 AbstractCegarLoop]: Abstraction has 14449 states and 20953 transitions. [2025-03-03 15:15:53,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 14449 states and 20953 transitions. [2025-03-03 15:15:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:15:53,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:53,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:53,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:15:53,783 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2077546624, now seen corresponding path program 1 times [2025-03-03 15:15:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:53,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329662859] [2025-03-03 15:15:53,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:53,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:15:53,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:15:53,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:53,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329662859] [2025-03-03 15:15:53,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329662859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:53,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:53,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:15:53,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172413208] [2025-03-03 15:15:53,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:53,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:53,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:53,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:53,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:53,864 INFO L87 Difference]: Start difference. First operand 14449 states and 20953 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:54,111 INFO L93 Difference]: Finished difference Result 47141 states and 68635 transitions. [2025-03-03 15:15:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:15:54,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 15:15:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:54,148 INFO L225 Difference]: With dead ends: 47141 [2025-03-03 15:15:54,148 INFO L226 Difference]: Without dead ends: 32795 [2025-03-03 15:15:54,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:54,166 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 842 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:54,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 340 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32795 states. [2025-03-03 15:15:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32795 to 30793. [2025-03-03 15:15:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30793 states, 30792 states have (on average 1.4482008313847752) internal successors, (44593), 30792 states have internal predecessors, (44593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30793 states to 30793 states and 44593 transitions. [2025-03-03 15:15:54,505 INFO L78 Accepts]: Start accepts. Automaton has 30793 states and 44593 transitions. Word has length 116 [2025-03-03 15:15:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:54,505 INFO L471 AbstractCegarLoop]: Abstraction has 30793 states and 44593 transitions. [2025-03-03 15:15:54,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30793 states and 44593 transitions. [2025-03-03 15:15:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:15:54,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:54,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:54,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:15:54,507 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:54,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1357992118, now seen corresponding path program 1 times [2025-03-03 15:15:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:54,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645499834] [2025-03-03 15:15:54,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:54,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:54,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:15:54,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:15:54,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:54,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645499834] [2025-03-03 15:15:54,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645499834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:54,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:54,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:54,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946261198] [2025-03-03 15:15:54,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:54,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:54,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:54,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:54,568 INFO L87 Difference]: Start difference. First operand 30793 states and 44593 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:54,725 INFO L93 Difference]: Finished difference Result 54397 states and 78811 transitions. [2025-03-03 15:15:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:54,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 15:15:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:54,760 INFO L225 Difference]: With dead ends: 54397 [2025-03-03 15:15:54,760 INFO L226 Difference]: Without dead ends: 29650 [2025-03-03 15:15:54,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:54,783 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 81 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 392 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-03 15:15:54,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 392 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29650 states. [2025-03-03 15:15:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29650 to 29648. [2025-03-03 15:15:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29648 states, 29647 states have (on average 1.4374135662967584) internal successors, (42615), 29647 states have internal predecessors, (42615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29648 states to 29648 states and 42615 transitions. [2025-03-03 15:15:55,169 INFO L78 Accepts]: Start accepts. Automaton has 29648 states and 42615 transitions. Word has length 116 [2025-03-03 15:15:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:55,169 INFO L471 AbstractCegarLoop]: Abstraction has 29648 states and 42615 transitions. [2025-03-03 15:15:55,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 29648 states and 42615 transitions. [2025-03-03 15:15:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 15:15:55,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:55,173 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-03-03 15:15:55,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:15:55,174 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:55,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash 619715490, now seen corresponding path program 1 times [2025-03-03 15:15:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:55,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528966647] [2025-03-03 15:15:55,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:55,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:55,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:15:55,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:15:55,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:55,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 15:15:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528966647] [2025-03-03 15:15:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528966647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:55,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842079326] [2025-03-03 15:15:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:55,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:55,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:55,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:55,246 INFO L87 Difference]: Start difference. First operand 29648 states and 42615 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:55,431 INFO L93 Difference]: Finished difference Result 57084 states and 81905 transitions. [2025-03-03 15:15:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 143 [2025-03-03 15:15:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:55,461 INFO L225 Difference]: With dead ends: 57084 [2025-03-03 15:15:55,461 INFO L226 Difference]: Without dead ends: 27535 [2025-03-03 15:15:55,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:55,475 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 77 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 383 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-03 15:15:55,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27535 states. [2025-03-03 15:15:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27535 to 26903. [2025-03-03 15:15:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26903 states, 26902 states have (on average 1.4257304289643893) internal successors, (38355), 26902 states have internal predecessors, (38355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26903 states to 26903 states and 38355 transitions. [2025-03-03 15:15:55,757 INFO L78 Accepts]: Start accepts. Automaton has 26903 states and 38355 transitions. Word has length 143 [2025-03-03 15:15:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:55,757 INFO L471 AbstractCegarLoop]: Abstraction has 26903 states and 38355 transitions. [2025-03-03 15:15:55,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 26903 states and 38355 transitions. [2025-03-03 15:15:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 15:15:55,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:55,761 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:15:55,761 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash 541951674, now seen corresponding path program 1 times [2025-03-03 15:15:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392949080] [2025-03-03 15:15:55,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:55,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 15:15:55,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 15:15:55,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:55,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 15:15:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392949080] [2025-03-03 15:15:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392949080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027346075] [2025-03-03 15:15:55,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:55,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:55,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:55,836 INFO L87 Difference]: Start difference. First operand 26903 states and 38355 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:55,918 INFO L93 Difference]: Finished difference Result 51615 states and 73413 transitions. [2025-03-03 15:15:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:55,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 144 [2025-03-03 15:15:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:55,943 INFO L225 Difference]: With dead ends: 51615 [2025-03-03 15:15:55,943 INFO L226 Difference]: Without dead ends: 24805 [2025-03-03 15:15:55,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:55,960 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 70 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 384 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-03 15:15:55,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 384 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24805 states. [2025-03-03 15:15:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24805 to 24203. [2025-03-03 15:15:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24203 states, 24202 states have (on average 1.4112470043798033) internal successors, (34155), 24202 states have internal predecessors, (34155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24203 states to 24203 states and 34155 transitions. [2025-03-03 15:15:56,226 INFO L78 Accepts]: Start accepts. Automaton has 24203 states and 34155 transitions. Word has length 144 [2025-03-03 15:15:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:56,226 INFO L471 AbstractCegarLoop]: Abstraction has 24203 states and 34155 transitions. [2025-03-03 15:15:56,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 24203 states and 34155 transitions. [2025-03-03 15:15:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 15:15:56,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:56,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:56,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:15:56,229 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1804014609, now seen corresponding path program 1 times [2025-03-03 15:15:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950716544] [2025-03-03 15:15:56,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:56,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 15:15:56,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 15:15:56,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:56,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:15:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950716544] [2025-03-03 15:15:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950716544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:56,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:56,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491971701] [2025-03-03 15:15:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:56,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:56,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:56,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:56,300 INFO L87 Difference]: Start difference. First operand 24203 states and 34155 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:56,374 INFO L93 Difference]: Finished difference Result 46215 states and 65013 transitions. [2025-03-03 15:15:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:56,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 145 [2025-03-03 15:15:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:56,396 INFO L225 Difference]: With dead ends: 46215 [2025-03-03 15:15:56,397 INFO L226 Difference]: Without dead ends: 22105 [2025-03-03 15:15:56,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:56,413 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 63 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 386 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-03 15:15:56,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 386 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22105 states. [2025-03-03 15:15:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22105 to 21503. [2025-03-03 15:15:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21503 states, 21502 states have (on average 1.3931262208166681) internal successors, (29955), 21502 states have internal predecessors, (29955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21503 states to 21503 states and 29955 transitions. [2025-03-03 15:15:56,646 INFO L78 Accepts]: Start accepts. Automaton has 21503 states and 29955 transitions. Word has length 145 [2025-03-03 15:15:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:56,646 INFO L471 AbstractCegarLoop]: Abstraction has 21503 states and 29955 transitions. [2025-03-03 15:15:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 21503 states and 29955 transitions. [2025-03-03 15:15:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 15:15:56,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:56,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:56,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:15:56,648 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:56,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1889006451, now seen corresponding path program 1 times [2025-03-03 15:15:56,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:56,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447609506] [2025-03-03 15:15:56,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:56,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 15:15:56,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 15:15:56,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:56,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:15:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:56,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447609506] [2025-03-03 15:15:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447609506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:56,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870509569] [2025-03-03 15:15:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:56,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:56,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:56,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:56,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:56,718 INFO L87 Difference]: Start difference. First operand 21503 states and 29955 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:56,803 INFO L93 Difference]: Finished difference Result 62123 states and 86069 transitions. [2025-03-03 15:15:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:56,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 146 [2025-03-03 15:15:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:56,844 INFO L225 Difference]: With dead ends: 62123 [2025-03-03 15:15:56,844 INFO L226 Difference]: Without dead ends: 40713 [2025-03-03 15:15:56,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:56,865 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 56 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 386 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-03 15:15:56,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 386 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40713 states. [2025-03-03 15:15:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40713 to 37911. [2025-03-03 15:15:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37911 states, 37910 states have (on average 1.3772355579002902) internal successors, (52211), 37910 states have internal predecessors, (52211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37911 states to 37911 states and 52211 transitions. [2025-03-03 15:15:57,360 INFO L78 Accepts]: Start accepts. Automaton has 37911 states and 52211 transitions. Word has length 146 [2025-03-03 15:15:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:57,360 INFO L471 AbstractCegarLoop]: Abstraction has 37911 states and 52211 transitions. [2025-03-03 15:15:57,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 37911 states and 52211 transitions. [2025-03-03 15:15:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:15:57,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:57,363 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:57,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:15:57,364 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:57,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash -833978493, now seen corresponding path program 1 times [2025-03-03 15:15:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:57,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647499547] [2025-03-03 15:15:57,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:57,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:15:57,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:15:57,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:57,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:57,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647499547] [2025-03-03 15:15:57,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647499547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:57,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:57,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088024261] [2025-03-03 15:15:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:57,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:57,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:57,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:57,457 INFO L87 Difference]: Start difference. First operand 37911 states and 52211 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:57,589 INFO L93 Difference]: Finished difference Result 66276 states and 91152 transitions. [2025-03-03 15:15:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-03 15:15:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:57,621 INFO L225 Difference]: With dead ends: 66276 [2025-03-03 15:15:57,621 INFO L226 Difference]: Without dead ends: 28458 [2025-03-03 15:15:57,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:57,645 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 83 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:57,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 361 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28458 states. [2025-03-03 15:15:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28458 to 28056. [2025-03-03 15:15:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28056 states, 28055 states have (on average 1.3589378007485298) internal successors, (38125), 28055 states have internal predecessors, (38125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28056 states to 28056 states and 38125 transitions. [2025-03-03 15:15:58,034 INFO L78 Accepts]: Start accepts. Automaton has 28056 states and 38125 transitions. Word has length 147 [2025-03-03 15:15:58,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:58,035 INFO L471 AbstractCegarLoop]: Abstraction has 28056 states and 38125 transitions. [2025-03-03 15:15:58,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 28056 states and 38125 transitions. [2025-03-03 15:15:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:15:58,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:58,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:58,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:15:58,037 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:58,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash 389499039, now seen corresponding path program 1 times [2025-03-03 15:15:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783964470] [2025-03-03 15:15:58,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:58,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:15:58,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:15:58,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:58,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:58,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783964470] [2025-03-03 15:15:58,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783964470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:15:58,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504037075] [2025-03-03 15:15:58,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:58,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:15:58,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:15:58,415 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-03 15:15:58,416 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-03 15:15:58,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:15:58,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:15:58,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:58,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:58,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 15:15:58,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:15:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:15:58,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:15:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:15:59,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504037075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:15:59,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:15:59,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 18 [2025-03-03 15:15:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504055685] [2025-03-03 15:15:59,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:15:59,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 15:15:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:59,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 15:15:59,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:15:59,043 INFO L87 Difference]: Start difference. First operand 28056 states and 38125 transitions. Second operand has 18 states, 18 states have (on average 23.055555555555557) internal successors, (415), 18 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:01,460 INFO L93 Difference]: Finished difference Result 227264 states and 310711 transitions. [2025-03-03 15:16:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-03 15:16:01,460 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 23.055555555555557) internal successors, (415), 18 states have internal predecessors, (415), 0 states have call successors, (0), 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 147 [2025-03-03 15:16:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:01,665 INFO L225 Difference]: With dead ends: 227264 [2025-03-03 15:16:01,665 INFO L226 Difference]: Without dead ends: 199338 [2025-03-03 15:16:01,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1100, Invalid=4906, Unknown=0, NotChecked=0, Total=6006 [2025-03-03 15:16:01,715 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 5841 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5841 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:01,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5841 Valid, 1537 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199338 states. [2025-03-03 15:16:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199338 to 149395. [2025-03-03 15:16:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149395 states, 149394 states have (on average 1.3366534131223475) internal successors, (199688), 149394 states have internal predecessors, (199688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149395 states to 149395 states and 199688 transitions. [2025-03-03 15:16:03,631 INFO L78 Accepts]: Start accepts. Automaton has 149395 states and 199688 transitions. Word has length 147 [2025-03-03 15:16:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:03,632 INFO L471 AbstractCegarLoop]: Abstraction has 149395 states and 199688 transitions. [2025-03-03 15:16:03,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 23.055555555555557) internal successors, (415), 18 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 149395 states and 199688 transitions. [2025-03-03 15:16:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:16:03,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:03,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:03,643 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-03 15:16:03,836 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,SelfDestructingSolverStorable39 [2025-03-03 15:16:03,836 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1934992422, now seen corresponding path program 1 times [2025-03-03 15:16:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024980463] [2025-03-03 15:16:03,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:03,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:16:03,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:16:03,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:03,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024980463] [2025-03-03 15:16:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024980463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:16:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828511806] [2025-03-03 15:16:04,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:16:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:16:04,329 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-03 15:16:04,330 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-03 15:16:04,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:16:04,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:16:04,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:04,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:04,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 15:16:04,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:16:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:05,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:16:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828511806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:16:07,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:16:07,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 32 [2025-03-03 15:16:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6954966] [2025-03-03 15:16:07,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:16:07,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 15:16:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:07,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 15:16:07,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 15:16:07,538 INFO L87 Difference]: Start difference. First operand 149395 states and 199688 transitions. Second operand has 33 states, 33 states have (on average 13.06060606060606) internal successors, (431), 32 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:21,794 INFO L93 Difference]: Finished difference Result 2721782 states and 3651098 transitions. [2025-03-03 15:16:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2025-03-03 15:16:21,795 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 13.06060606060606) internal successors, (431), 32 states have internal predecessors, (431), 0 states have call successors, (0), 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 148 [2025-03-03 15:16:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:26,441 INFO L225 Difference]: With dead ends: 2721782 [2025-03-03 15:16:26,442 INFO L226 Difference]: Without dead ends: 2578888 [2025-03-03 15:16:26,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21505 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6789, Invalid=52017, Unknown=0, NotChecked=0, Total=58806 [2025-03-03 15:16:26,799 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 6158 mSDsluCounter, 3525 mSDsCounter, 0 mSdLazyCounter, 5519 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6158 SdHoareTripleChecker+Valid, 3774 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 5519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:26,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6158 Valid, 3774 Invalid, 5599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 5519 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 15:16:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578888 states.