./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.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.7.ufo.BOUNDED-14.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 4008c7bad6e9f0faf3cf745d811b7950453991ed3720a7122a910bf51077877c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:18:04,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:18:04,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:18:04,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:18:04,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:18:04,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:18:04,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:18:04,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:18:04,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:18:04,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:18:04,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:18:04,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:18:04,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:18:04,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:18:04,313 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:18:04,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:18:04,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:18:04,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:18:04,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:18:04,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:18:04,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:18:04,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:18:04,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:18:04,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:18:04,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:18:04,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:18:04,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:18:04,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:18:04,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:18:04,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:18:04,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:18:04,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:18:04,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:18:04,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:18:04,317 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 -> 4008c7bad6e9f0faf3cf745d811b7950453991ed3720a7122a910bf51077877c [2025-03-03 15:18:04,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:18:04,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:18:04,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:18:04,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:18:04,556 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:18:04,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2025-03-03 15:18:05,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23133614/f5501192e514428884b3df022f9410c1/FLAGf55710b07 [2025-03-03 15:18:05,911 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:18:05,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2025-03-03 15:18:05,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23133614/f5501192e514428884b3df022f9410c1/FLAGf55710b07 [2025-03-03 15:18:05,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23133614/f5501192e514428884b3df022f9410c1 [2025-03-03 15:18:05,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:18:05,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:18:05,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:18:05,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:18:05,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:18:05,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:18:05" (1/1) ... [2025-03-03 15:18:05,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594880c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:05, skipping insertion in model container [2025-03-03 15:18:05,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:18:05" (1/1) ... [2025-03-03 15:18:05,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:18:06,138 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.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c[10525,10538] [2025-03-03 15:18:06,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:18:06,196 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:18:06,263 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.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c[10525,10538] [2025-03-03 15:18:06,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:18:06,303 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:18:06,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06 WrapperNode [2025-03-03 15:18:06,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:18:06,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:18:06,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:18:06,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:18:06,308 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:18:06" (1/1) ... [2025-03-03 15:18:06,316 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:18:06" (1/1) ... [2025-03-03 15:18:06,341 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 917 [2025-03-03 15:18:06,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:18:06,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:18:06,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:18:06,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:18:06,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,361 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:18:06,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:18:06,375 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:18:06,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:18:06,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:18:06,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (1/1) ... [2025-03-03 15:18:06,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:18:06,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:18:06,405 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:18:06,410 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:18:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:18:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:18:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:18:06,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:18:06,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:18:06,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: havoc main_~node5__m5~2#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L995: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L863: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: havoc main_~node4__m4~2#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~2#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: havoc main_~node3__m3~2#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: havoc main_~node2__m2~2#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L818: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L773: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: havoc main_~node7__m7~1#1;havoc main_~node6__m6~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_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~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:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L908: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:18:07,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:18:07,178 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-03 15:18:07,179 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:18:07,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:18:07,189 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:18:07,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:18:07 BoogieIcfgContainer [2025-03-03 15:18:07,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:18:07,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:18:07,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:18:07,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:18:07,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:18:05" (1/3) ... [2025-03-03 15:18:07,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abe9d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:18:07, skipping insertion in model container [2025-03-03 15:18:07,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:06" (2/3) ... [2025-03-03 15:18:07,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abe9d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:18:07, skipping insertion in model container [2025-03-03 15:18:07,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:18:07" (3/3) ... [2025-03-03 15:18:07,198 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2025-03-03 15:18:07,208 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:18:07,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c that has 1 procedures, 202 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:18:07,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:18:07,263 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;@67d9789, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:18:07,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:18:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 200 states have (on average 1.765) internal successors, (353), 201 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:18:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:18:07,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:07,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:07,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:07,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1951735242, now seen corresponding path program 1 times [2025-03-03 15:18:07,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:07,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847242742] [2025-03-03 15:18:07,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:07,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:07,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:18:07,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:18:07,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:07,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:08,052 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:18:08,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847242742] [2025-03-03 15:18:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847242742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:08,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:08,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882687510] [2025-03-03 15:18:08,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:08,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:08,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:08,078 INFO L87 Difference]: Start difference. First operand has 202 states, 200 states have (on average 1.765) internal successors, (353), 201 states have internal predecessors, (353), 0 states have call successors, (0), 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 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:08,690 INFO L93 Difference]: Finished difference Result 1459 states and 2342 transitions. [2025-03-03 15:18:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-03 15:18:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:08,711 INFO L225 Difference]: With dead ends: 1459 [2025-03-03 15:18:08,712 INFO L226 Difference]: Without dead ends: 1333 [2025-03-03 15:18:08,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:18:08,721 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 2444 mSDsluCounter, 6790 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2444 SdHoareTripleChecker+Valid, 7862 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:08,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2444 Valid, 7862 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:18:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-03-03 15:18:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 304. [2025-03-03 15:18:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4422442244224423) internal successors, (437), 303 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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:18:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 437 transitions. [2025-03-03 15:18:08,798 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 437 transitions. Word has length 108 [2025-03-03 15:18:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:08,799 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 437 transitions. [2025-03-03 15:18:08,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 437 transitions. [2025-03-03 15:18:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:08,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:08,801 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, 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:18:08,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:18:08,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:08,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash -563796806, now seen corresponding path program 1 times [2025-03-03 15:18:08,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:08,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004402363] [2025-03-03 15:18:08,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:08,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:08,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:08,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:08,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:08,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:09,168 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:18:09,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:09,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004402363] [2025-03-03 15:18:09,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004402363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:09,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:09,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:09,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337882876] [2025-03-03 15:18:09,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:09,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:09,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:09,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:09,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:09,171 INFO L87 Difference]: Start difference. First operand 304 states and 437 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:09,509 INFO L93 Difference]: Finished difference Result 1560 states and 2419 transitions. [2025-03-03 15:18:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:09,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:09,517 INFO L225 Difference]: With dead ends: 1560 [2025-03-03 15:18:09,519 INFO L226 Difference]: Without dead ends: 1400 [2025-03-03 15:18:09,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:09,522 INFO L435 NwaCegarLoop]: 1033 mSDtfsCounter, 1714 mSDsluCounter, 3753 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 4786 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:09,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 4786 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-03-03 15:18:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 483. [2025-03-03 15:18:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.495850622406639) internal successors, (721), 482 states have internal predecessors, (721), 0 states have call successors, (0), 0 states 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:18:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 721 transitions. [2025-03-03 15:18:09,565 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 721 transitions. Word has length 110 [2025-03-03 15:18:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:09,565 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 721 transitions. [2025-03-03 15:18:09,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 721 transitions. [2025-03-03 15:18:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:09,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:09,567 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, 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:18:09,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:18:09,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1542659918, now seen corresponding path program 1 times [2025-03-03 15:18:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882118837] [2025-03-03 15:18:09,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:09,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:09,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:09,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:09,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:09,886 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:18:09,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:09,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882118837] [2025-03-03 15:18:09,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882118837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:09,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:09,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372512521] [2025-03-03 15:18:09,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:09,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:09,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:09,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:09,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:09,888 INFO L87 Difference]: Start difference. First operand 483 states and 721 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:10,207 INFO L93 Difference]: Finished difference Result 1739 states and 2703 transitions. [2025-03-03 15:18:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:10,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:10,212 INFO L225 Difference]: With dead ends: 1739 [2025-03-03 15:18:10,213 INFO L226 Difference]: Without dead ends: 1579 [2025-03-03 15:18:10,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:10,214 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1707 mSDsluCounter, 3216 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 4140 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:10,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 4140 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-03-03 15:18:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 741. [2025-03-03 15:18:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.527027027027027) internal successors, (1130), 740 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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:18:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1130 transitions. [2025-03-03 15:18:10,241 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1130 transitions. Word has length 110 [2025-03-03 15:18:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:10,242 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1130 transitions. [2025-03-03 15:18:10,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1130 transitions. [2025-03-03 15:18:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:10,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:10,243 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, 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:18:10,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:18:10,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:10,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1904699322, now seen corresponding path program 1 times [2025-03-03 15:18:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:10,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352818519] [2025-03-03 15:18:10,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:10,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:10,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:10,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:10,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:10,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:10,493 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:18:10,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:10,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352818519] [2025-03-03 15:18:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352818519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:10,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848275807] [2025-03-03 15:18:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:10,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:10,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:10,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:10,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:10,494 INFO L87 Difference]: Start difference. First operand 741 states and 1130 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:10,729 INFO L93 Difference]: Finished difference Result 1913 states and 2979 transitions. [2025-03-03 15:18:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:10,735 INFO L225 Difference]: With dead ends: 1913 [2025-03-03 15:18:10,735 INFO L226 Difference]: Without dead ends: 1753 [2025-03-03 15:18:10,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:10,739 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 1814 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 3284 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:10,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 3284 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2025-03-03 15:18:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 915. [2025-03-03 15:18:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.538293216630197) internal successors, (1406), 914 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states 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:18:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1406 transitions. [2025-03-03 15:18:10,768 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1406 transitions. Word has length 110 [2025-03-03 15:18:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:10,769 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1406 transitions. [2025-03-03 15:18:10,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1406 transitions. [2025-03-03 15:18:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:10,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:10,770 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, 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:18:10,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:18:10,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1899397710, now seen corresponding path program 1 times [2025-03-03 15:18:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:10,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190819316] [2025-03-03 15:18:10,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:10,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:10,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:10,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:10,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:10,965 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:18:10,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:10,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190819316] [2025-03-03 15:18:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190819316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:10,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:10,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:10,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498064773] [2025-03-03 15:18:10,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:10,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:10,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:10,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:10,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:10,967 INFO L87 Difference]: Start difference. First operand 915 states and 1406 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:11,213 INFO L93 Difference]: Finished difference Result 2082 states and 3247 transitions. [2025-03-03 15:18:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:11,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:11,219 INFO L225 Difference]: With dead ends: 2082 [2025-03-03 15:18:11,219 INFO L226 Difference]: Without dead ends: 1922 [2025-03-03 15:18:11,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:11,221 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 1918 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 3110 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:11,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 3110 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-03-03 15:18:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1084. [2025-03-03 15:18:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5457063711911356) internal successors, (1674), 1083 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:18:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1674 transitions. [2025-03-03 15:18:11,249 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1674 transitions. Word has length 110 [2025-03-03 15:18:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:11,250 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1674 transitions. [2025-03-03 15:18:11,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1674 transitions. [2025-03-03 15:18:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:11,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:11,252 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, 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:18:11,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:18:11,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:11,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1873286470, now seen corresponding path program 1 times [2025-03-03 15:18:11,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:11,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530912160] [2025-03-03 15:18:11,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:11,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:11,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:11,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:11,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:11,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:11,443 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:18:11,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:11,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530912160] [2025-03-03 15:18:11,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530912160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:11,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:11,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609501148] [2025-03-03 15:18:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:11,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:11,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:11,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:11,445 INFO L87 Difference]: Start difference. First operand 1084 states and 1674 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:11,674 INFO L93 Difference]: Finished difference Result 2246 states and 3507 transitions. [2025-03-03 15:18:11,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:11,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:11,680 INFO L225 Difference]: With dead ends: 2246 [2025-03-03 15:18:11,680 INFO L226 Difference]: Without dead ends: 2086 [2025-03-03 15:18:11,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:11,681 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2021 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 3120 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:11,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 3120 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2025-03-03 15:18:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1248. [2025-03-03 15:18:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 1.5509222133119487) internal successors, (1934), 1247 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states 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:18:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1934 transitions. [2025-03-03 15:18:11,709 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1934 transitions. Word has length 110 [2025-03-03 15:18:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:11,710 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1934 transitions. [2025-03-03 15:18:11,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1934 transitions. [2025-03-03 15:18:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:11,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:11,711 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, 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:18:11,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:18:11,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:11,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash -159393102, now seen corresponding path program 1 times [2025-03-03 15:18:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:11,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520007377] [2025-03-03 15:18:11,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:11,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:11,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:11,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:11,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:11,886 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:18:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520007377] [2025-03-03 15:18:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520007377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:11,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:11,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655212311] [2025-03-03 15:18:11,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:11,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:11,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:11,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:11,888 INFO L87 Difference]: Start difference. First operand 1248 states and 1934 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:12,106 INFO L93 Difference]: Finished difference Result 2405 states and 3759 transitions. [2025-03-03 15:18:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:12,113 INFO L225 Difference]: With dead ends: 2405 [2025-03-03 15:18:12,113 INFO L226 Difference]: Without dead ends: 2245 [2025-03-03 15:18:12,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:12,114 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2121 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2121 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:12,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2121 Valid, 3426 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2025-03-03 15:18:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1407. [2025-03-03 15:18:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1406 states have (on average 1.5547652916073968) internal successors, (2186), 1406 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states 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:18:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 2186 transitions. [2025-03-03 15:18:12,143 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 2186 transitions. Word has length 110 [2025-03-03 15:18:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:12,144 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 2186 transitions. [2025-03-03 15:18:12,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2186 transitions. [2025-03-03 15:18:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:12,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:12,145 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, 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:18:12,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:18:12,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:12,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash 48451154, now seen corresponding path program 1 times [2025-03-03 15:18:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:12,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884050186] [2025-03-03 15:18:12,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:12,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:12,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:12,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:12,318 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:18:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884050186] [2025-03-03 15:18:12,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884050186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:12,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:12,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:12,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425045045] [2025-03-03 15:18:12,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:12,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:12,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:12,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:12,320 INFO L87 Difference]: Start difference. First operand 1407 states and 2186 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:12,540 INFO L93 Difference]: Finished difference Result 2563 states and 4010 transitions. [2025-03-03 15:18:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:12,548 INFO L225 Difference]: With dead ends: 2563 [2025-03-03 15:18:12,548 INFO L226 Difference]: Without dead ends: 2403 [2025-03-03 15:18:12,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:12,550 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 2216 mSDsluCounter, 3315 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 3702 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:12,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 3702 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-03-03 15:18:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1565. [2025-03-03 15:18:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1564 states have (on average 1.5581841432225063) internal successors, (2437), 1564 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states 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:18:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2437 transitions. [2025-03-03 15:18:12,585 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2437 transitions. Word has length 110 [2025-03-03 15:18:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:12,586 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2437 transitions. [2025-03-03 15:18:12,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2437 transitions. [2025-03-03 15:18:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:12,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:12,587 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, 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:18:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:18:12,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1322173279, now seen corresponding path program 1 times [2025-03-03 15:18:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245911] [2025-03-03 15:18:12,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:12,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:12,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:12,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245911] [2025-03-03 15:18:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:12,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:12,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:18:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089379] [2025-03-03 15:18:12,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:12,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:18:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:12,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:18:12,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:18:12,644 INFO L87 Difference]: Start difference. First operand 1565 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:12,670 INFO L93 Difference]: Finished difference Result 4145 states and 6513 transitions. [2025-03-03 15:18:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:18:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:12,679 INFO L225 Difference]: With dead ends: 4145 [2025-03-03 15:18:12,679 INFO L226 Difference]: Without dead ends: 2800 [2025-03-03 15:18:12,681 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:18:12,681 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 115 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:12,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 640 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2025-03-03 15:18:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2798. [2025-03-03 15:18:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.5527350732928138) internal successors, (4343), 2797 states have internal predecessors, (4343), 0 states have call successors, (0), 0 states 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:18:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4343 transitions. [2025-03-03 15:18:12,728 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4343 transitions. Word has length 110 [2025-03-03 15:18:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:12,728 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4343 transitions. [2025-03-03 15:18:12,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4343 transitions. [2025-03-03 15:18:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:12,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:12,730 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, 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:18:12,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:18:12,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:12,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1323335128, now seen corresponding path program 1 times [2025-03-03 15:18:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044003961] [2025-03-03 15:18:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:12,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:12,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:12,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:13,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:13,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044003961] [2025-03-03 15:18:13,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044003961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:13,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:13,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428232238] [2025-03-03 15:18:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:13,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:13,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:13,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:13,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:13,107 INFO L87 Difference]: Start difference. First operand 2798 states and 4343 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:13,396 INFO L93 Difference]: Finished difference Result 5378 states and 8385 transitions. [2025-03-03 15:18:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:13,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:13,404 INFO L225 Difference]: With dead ends: 5378 [2025-03-03 15:18:13,405 INFO L226 Difference]: Without dead ends: 2800 [2025-03-03 15:18:13,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:13,408 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 507 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:13,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1229 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2025-03-03 15:18:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2798. [2025-03-03 15:18:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.5495173400071505) internal successors, (4334), 2797 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states 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:18:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4334 transitions. [2025-03-03 15:18:13,456 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4334 transitions. Word has length 110 [2025-03-03 15:18:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:13,456 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4334 transitions. [2025-03-03 15:18:13,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4334 transitions. [2025-03-03 15:18:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:18:13,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:13,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:13,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:18:13,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:13,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1957528038, now seen corresponding path program 1 times [2025-03-03 15:18:13,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:13,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866576763] [2025-03-03 15:18:13,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:13,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:13,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:18:13,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:18:13,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:13,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:13,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866576763] [2025-03-03 15:18:13,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866576763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:13,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:13,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:13,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795409271] [2025-03-03 15:18:13,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:13,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:13,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:13,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:13,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:13,577 INFO L87 Difference]: Start difference. First operand 2798 states and 4334 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:18:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:13,709 INFO L93 Difference]: Finished difference Result 5539 states and 8610 transitions. [2025-03-03 15:18:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:13,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 15:18:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:13,717 INFO L225 Difference]: With dead ends: 5539 [2025-03-03 15:18:13,717 INFO L226 Difference]: Without dead ends: 2798 [2025-03-03 15:18:13,720 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:18:13,720 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 742 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:13,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 149 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-03 15:18:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798. [2025-03-03 15:18:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.5370039327851268) internal successors, (4299), 2797 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states 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:18:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4299 transitions. [2025-03-03 15:18:13,783 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4299 transitions. Word has length 111 [2025-03-03 15:18:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:13,783 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4299 transitions. [2025-03-03 15:18:13,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:18:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4299 transitions. [2025-03-03 15:18:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:13,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:13,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:13,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:18:13,785 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:13,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash 995780415, now seen corresponding path program 1 times [2025-03-03 15:18:13,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:13,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57121234] [2025-03-03 15:18:13,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:13,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:13,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:13,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:13,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:13,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:13,892 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:18:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57121234] [2025-03-03 15:18:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57121234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049565102] [2025-03-03 15:18:13,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:13,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:13,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:13,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:13,893 INFO L87 Difference]: Start difference. First operand 2798 states and 4299 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:18:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:14,026 INFO L93 Difference]: Finished difference Result 5527 states and 8526 transitions. [2025-03-03 15:18:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:14,033 INFO L225 Difference]: With dead ends: 5527 [2025-03-03 15:18:14,033 INFO L226 Difference]: Without dead ends: 2798 [2025-03-03 15:18:14,036 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:18:14,036 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 702 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:14,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 173 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-03 15:18:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798. [2025-03-03 15:18:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.5244905255631034) internal successors, (4264), 2797 states have internal predecessors, (4264), 0 states have call successors, (0), 0 states 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:18:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4264 transitions. [2025-03-03 15:18:14,070 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4264 transitions. Word has length 112 [2025-03-03 15:18:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:14,070 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4264 transitions. [2025-03-03 15:18:14,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:18:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4264 transitions. [2025-03-03 15:18:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:18:14,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:14,071 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, 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:18:14,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:18:14,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:14,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -617559146, now seen corresponding path program 1 times [2025-03-03 15:18:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074147241] [2025-03-03 15:18:14,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:14,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:18:14,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:18:14,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:14,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:14,167 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:18:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074147241] [2025-03-03 15:18:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074147241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112314361] [2025-03-03 15:18:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:14,169 INFO L87 Difference]: Start difference. First operand 2798 states and 4264 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:18:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:14,281 INFO L93 Difference]: Finished difference Result 5515 states and 8442 transitions. [2025-03-03 15:18:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:18:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:14,287 INFO L225 Difference]: With dead ends: 5515 [2025-03-03 15:18:14,287 INFO L226 Difference]: Without dead ends: 2798 [2025-03-03 15:18:14,289 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:18:14,290 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 663 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:14,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 201 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-03 15:18:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798. [2025-03-03 15:18:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.5119771183410797) internal successors, (4229), 2797 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states 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:18:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4229 transitions. [2025-03-03 15:18:14,320 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4229 transitions. Word has length 113 [2025-03-03 15:18:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:14,320 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4229 transitions. [2025-03-03 15:18:14,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:18:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4229 transitions. [2025-03-03 15:18:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:14,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:14,322 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, 1, 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:18:14,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:18:14,322 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:14,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash 269951427, now seen corresponding path program 1 times [2025-03-03 15:18:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633592912] [2025-03-03 15:18:14,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:14,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:14,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:14,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:14,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:14,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:14,431 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:18:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:14,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633592912] [2025-03-03 15:18:14,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633592912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:14,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:14,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115467985] [2025-03-03 15:18:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:14,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:14,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:14,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:14,433 INFO L87 Difference]: Start difference. First operand 2798 states and 4229 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:18:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:14,544 INFO L93 Difference]: Finished difference Result 5523 states and 8382 transitions. [2025-03-03 15:18:14,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-03 15:18:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:14,549 INFO L225 Difference]: With dead ends: 5523 [2025-03-03 15:18:14,549 INFO L226 Difference]: Without dead ends: 2798 [2025-03-03 15:18:14,552 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:18:14,552 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 678 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:14,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 181 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-03 15:18:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798. [2025-03-03 15:18:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.499463711119056) internal successors, (4194), 2797 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states 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:18:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4194 transitions. [2025-03-03 15:18:14,583 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4194 transitions. Word has length 114 [2025-03-03 15:18:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:14,583 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4194 transitions. [2025-03-03 15:18:14,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:18:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4194 transitions. [2025-03-03 15:18:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 15:18:14,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:14,585 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, 1, 1, 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:18:14,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:18:14,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:14,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash 304815798, now seen corresponding path program 1 times [2025-03-03 15:18:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:14,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578428928] [2025-03-03 15:18:14,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:14,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:18:14,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:18:14,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:14,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:14,676 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:18:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:14,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578428928] [2025-03-03 15:18:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578428928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:14,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:14,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937160130] [2025-03-03 15:18:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:14,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:14,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:14,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:14,678 INFO L87 Difference]: Start difference. First operand 2798 states and 4194 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:18:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:14,792 INFO L93 Difference]: Finished difference Result 5535 states and 8326 transitions. [2025-03-03 15:18:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:14,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-03 15:18:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:14,796 INFO L225 Difference]: With dead ends: 5535 [2025-03-03 15:18:14,796 INFO L226 Difference]: Without dead ends: 2798 [2025-03-03 15:18:14,799 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:18:14,799 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 706 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:14,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 157 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-03 15:18:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798. [2025-03-03 15:18:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.4869503038970326) internal successors, (4159), 2797 states have internal predecessors, (4159), 0 states have call successors, (0), 0 states 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:18:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4159 transitions. [2025-03-03 15:18:14,831 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4159 transitions. Word has length 115 [2025-03-03 15:18:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:14,831 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4159 transitions. [2025-03-03 15:18:14,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:18:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4159 transitions. [2025-03-03 15:18:14,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:18:14,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:14,832 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, 1, 1, 1, 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:18:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:18:14,833 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:14,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1148532353, now seen corresponding path program 1 times [2025-03-03 15:18:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:14,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10989488] [2025-03-03 15:18:14,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:14,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:18:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:18:14,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:14,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:14,930 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:18:14,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10989488] [2025-03-03 15:18:14,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10989488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:14,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:14,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:14,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753972450] [2025-03-03 15:18:14,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:14,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:14,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:14,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:14,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:14,931 INFO L87 Difference]: Start difference. First operand 2798 states and 4159 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 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:18:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:15,041 INFO L93 Difference]: Finished difference Result 5531 states and 8252 transitions. [2025-03-03 15:18:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:15,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 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:18:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:15,046 INFO L225 Difference]: With dead ends: 5531 [2025-03-03 15:18:15,046 INFO L226 Difference]: Without dead ends: 2798 [2025-03-03 15:18:15,049 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:18:15,050 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 688 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:15,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 165 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-03 15:18:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798. [2025-03-03 15:18:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.474436896675009) internal successors, (4124), 2797 states have internal predecessors, (4124), 0 states have call successors, (0), 0 states 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:18:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4124 transitions. [2025-03-03 15:18:15,105 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4124 transitions. Word has length 116 [2025-03-03 15:18:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:15,105 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4124 transitions. [2025-03-03 15:18:15,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 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:18:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4124 transitions. [2025-03-03 15:18:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 15:18:15,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:15,107 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, 1, 1, 1, 1, 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:18:15,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:18:15,107 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:15,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1535880754, now seen corresponding path program 1 times [2025-03-03 15:18:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:15,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028441815] [2025-03-03 15:18:15,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:15,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 15:18:15,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 15:18:15,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:15,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028441815] [2025-03-03 15:18:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028441815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:15,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263495740] [2025-03-03 15:18:15,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:15,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:15,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:15,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:15,193 INFO L87 Difference]: Start difference. First operand 2798 states and 4124 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:18:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:15,306 INFO L93 Difference]: Finished difference Result 5519 states and 8170 transitions. [2025-03-03 15:18:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:15,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-03 15:18:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:15,310 INFO L225 Difference]: With dead ends: 5519 [2025-03-03 15:18:15,310 INFO L226 Difference]: Without dead ends: 2798 [2025-03-03 15:18:15,312 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:18:15,312 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 646 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:15,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 189 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:15,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-03 15:18:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798. [2025-03-03 15:18:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.4619234894529853) internal successors, (4089), 2797 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states 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:18:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4089 transitions. [2025-03-03 15:18:15,337 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4089 transitions. Word has length 117 [2025-03-03 15:18:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:15,337 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4089 transitions. [2025-03-03 15:18:15,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:18:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4089 transitions. [2025-03-03 15:18:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 15:18:15,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:15,338 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, 1, 1, 1, 1, 1, 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:18:15,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:18:15,339 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:15,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1933527883, now seen corresponding path program 1 times [2025-03-03 15:18:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976812219] [2025-03-03 15:18:15,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:15,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 15:18:15,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 15:18:15,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:15,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:15,523 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:18:15,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976812219] [2025-03-03 15:18:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976812219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131807846] [2025-03-03 15:18:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:15,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:18:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:15,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:18:15,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:18:15,524 INFO L87 Difference]: Start difference. First operand 2798 states and 4089 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:18:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:15,551 INFO L93 Difference]: Finished difference Result 6628 states and 9730 transitions. [2025-03-03 15:18:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:18:15,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 15:18:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:15,557 INFO L225 Difference]: With dead ends: 6628 [2025-03-03 15:18:15,557 INFO L226 Difference]: Without dead ends: 4050 [2025-03-03 15:18:15,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:18:15,560 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 133 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:15,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 682 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2025-03-03 15:18:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 4048. [2025-03-03 15:18:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4048 states, 4047 states have (on average 1.460093896713615) internal successors, (5909), 4047 states have internal predecessors, (5909), 0 states have call successors, (0), 0 states 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:18:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5909 transitions. [2025-03-03 15:18:15,621 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5909 transitions. Word has length 118 [2025-03-03 15:18:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:15,621 INFO L471 AbstractCegarLoop]: Abstraction has 4048 states and 5909 transitions. [2025-03-03 15:18:15,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:18:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5909 transitions. [2025-03-03 15:18:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 15:18:15,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:15,622 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, 1, 1, 1, 1, 1, 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:18:15,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:18:15,622 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:15,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1965731954, now seen corresponding path program 1 times [2025-03-03 15:18:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:15,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413773443] [2025-03-03 15:18:15,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:15,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 15:18:15,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 15:18:15,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:15,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:16,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:16,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413773443] [2025-03-03 15:18:16,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413773443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:16,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:16,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:16,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826702553] [2025-03-03 15:18:16,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:16,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:16,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:16,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:16,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:16,029 INFO L87 Difference]: Start difference. First operand 4048 states and 5909 transitions. Second operand has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:18:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:16,594 INFO L93 Difference]: Finished difference Result 11905 states and 17389 transitions. [2025-03-03 15:18:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 15:18:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:16,605 INFO L225 Difference]: With dead ends: 11905 [2025-03-03 15:18:16,605 INFO L226 Difference]: Without dead ends: 8040 [2025-03-03 15:18:16,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:18:16,611 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1222 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:16,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 854 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:18:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8040 states. [2025-03-03 15:18:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8040 to 4048. [2025-03-03 15:18:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4048 states, 4047 states have (on average 1.4586113170249568) internal successors, (5903), 4047 states have internal predecessors, (5903), 0 states have call successors, (0), 0 states 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:18:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5903 transitions. [2025-03-03 15:18:16,701 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5903 transitions. Word has length 118 [2025-03-03 15:18:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:16,702 INFO L471 AbstractCegarLoop]: Abstraction has 4048 states and 5903 transitions. [2025-03-03 15:18:16,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:18:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5903 transitions. [2025-03-03 15:18:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 15:18:16,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:16,703 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, 1, 1, 1, 1, 1, 1, 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:18:16,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:18:16,704 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:16,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:16,704 INFO L85 PathProgramCache]: Analyzing trace with hash 859338029, now seen corresponding path program 1 times [2025-03-03 15:18:16,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:16,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933161245] [2025-03-03 15:18:16,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:16,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:16,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 15:18:16,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 15:18:16,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:16,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933161245] [2025-03-03 15:18:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933161245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:17,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:17,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238887863] [2025-03-03 15:18:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:17,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:18:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:17,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:18:17,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:17,104 INFO L87 Difference]: Start difference. First operand 4048 states and 5903 transitions. Second operand has 14 states, 14 states have (on average 8.5) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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:18:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:17,724 INFO L93 Difference]: Finished difference Result 12039 states and 17523 transitions. [2025-03-03 15:18:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:18:17,725 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.5) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-03 15:18:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:17,735 INFO L225 Difference]: With dead ends: 12039 [2025-03-03 15:18:17,735 INFO L226 Difference]: Without dead ends: 8205 [2025-03-03 15:18:17,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:18:17,742 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1195 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:17,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1019 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:18:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2025-03-03 15:18:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 4121. [2025-03-03 15:18:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4121 states, 4120 states have (on average 1.4572815533980583) internal successors, (6004), 4120 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states 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:18:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6004 transitions. [2025-03-03 15:18:17,802 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6004 transitions. Word has length 119 [2025-03-03 15:18:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:17,802 INFO L471 AbstractCegarLoop]: Abstraction has 4121 states and 6004 transitions. [2025-03-03 15:18:17,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.5) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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:18:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6004 transitions. [2025-03-03 15:18:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 15:18:17,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:17,803 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, 1, 1, 1, 1, 1, 1, 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:18:17,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:18:17,803 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:17,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash 769725221, now seen corresponding path program 1 times [2025-03-03 15:18:17,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864272889] [2025-03-03 15:18:17,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:17,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 15:18:17,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 15:18:17,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:17,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:18,128 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:18:18,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:18,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864272889] [2025-03-03 15:18:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864272889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:18,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602453926] [2025-03-03 15:18:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:18,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:18,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:18,131 INFO L87 Difference]: Start difference. First operand 4121 states and 6004 transitions. Second operand has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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:18:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:18,705 INFO L93 Difference]: Finished difference Result 12006 states and 17506 transitions. [2025-03-03 15:18:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:18,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-03 15:18:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:18,716 INFO L225 Difference]: With dead ends: 12006 [2025-03-03 15:18:18,717 INFO L226 Difference]: Without dead ends: 8178 [2025-03-03 15:18:18,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:18:18,722 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1269 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:18,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 848 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:18:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2025-03-03 15:18:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 4145. [2025-03-03 15:18:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 4144 states have (on average 1.4565637065637065) internal successors, (6036), 4144 states have internal predecessors, (6036), 0 states have call successors, (0), 0 states 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:18:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 6036 transitions. [2025-03-03 15:18:18,777 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 6036 transitions. Word has length 119 [2025-03-03 15:18:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:18,777 INFO L471 AbstractCegarLoop]: Abstraction has 4145 states and 6036 transitions. [2025-03-03 15:18:18,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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:18:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6036 transitions. [2025-03-03 15:18:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 15:18:18,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:18,778 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, 1, 1, 1, 1, 1, 1, 1, 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:18:18,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:18:18,779 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:18,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:18,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1783454843, now seen corresponding path program 1 times [2025-03-03 15:18:18,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:18,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926422890] [2025-03-03 15:18:18,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:18,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:18,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 15:18:18,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 15:18:18,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:18,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:18,992 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:18:18,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926422890] [2025-03-03 15:18:18,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926422890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:18,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:18,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107220834] [2025-03-03 15:18:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:18,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:18,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:18,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:18,994 INFO L87 Difference]: Start difference. First operand 4145 states and 6036 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:18:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:19,301 INFO L93 Difference]: Finished difference Result 11822 states and 17291 transitions. [2025-03-03 15:18:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:19,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-03 15:18:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:19,314 INFO L225 Difference]: With dead ends: 11822 [2025-03-03 15:18:19,314 INFO L226 Difference]: Without dead ends: 7973 [2025-03-03 15:18:19,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:19,321 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 695 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:19,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 644 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7973 states. [2025-03-03 15:18:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7973 to 4145. [2025-03-03 15:18:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 4144 states have (on average 1.456322393822394) internal successors, (6035), 4144 states have internal predecessors, (6035), 0 states have call successors, (0), 0 states 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:18:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 6035 transitions. [2025-03-03 15:18:19,406 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 6035 transitions. Word has length 120 [2025-03-03 15:18:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:19,406 INFO L471 AbstractCegarLoop]: Abstraction has 4145 states and 6035 transitions. [2025-03-03 15:18:19,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:18:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6035 transitions. [2025-03-03 15:18:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 15:18:19,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:19,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:19,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:18:19,407 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:19,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1568429994, now seen corresponding path program 1 times [2025-03-03 15:18:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861159366] [2025-03-03 15:18:19,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:19,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 15:18:19,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 15:18:19,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:19,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:19,501 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:18:19,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:19,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861159366] [2025-03-03 15:18:19,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861159366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:19,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:18:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382173408] [2025-03-03 15:18:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:19,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:18:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:19,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:18:19,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:18:19,502 INFO L87 Difference]: Start difference. First operand 4145 states and 6035 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:18:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:19,530 INFO L93 Difference]: Finished difference Result 11597 states and 17008 transitions. [2025-03-03 15:18:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:18:19,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-03 15:18:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:19,541 INFO L225 Difference]: With dead ends: 11597 [2025-03-03 15:18:19,541 INFO L226 Difference]: Without dead ends: 7769 [2025-03-03 15:18:19,545 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:18:19,546 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:19,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 555 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7769 states. [2025-03-03 15:18:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7769 to 7563. [2025-03-03 15:18:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7563 states, 7562 states have (on average 1.4516001057921184) internal successors, (10977), 7562 states have internal predecessors, (10977), 0 states have call successors, (0), 0 states 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:18:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7563 states to 7563 states and 10977 transitions. [2025-03-03 15:18:19,618 INFO L78 Accepts]: Start accepts. Automaton has 7563 states and 10977 transitions. Word has length 121 [2025-03-03 15:18:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:19,618 INFO L471 AbstractCegarLoop]: Abstraction has 7563 states and 10977 transitions. [2025-03-03 15:18:19,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:18:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 7563 states and 10977 transitions. [2025-03-03 15:18:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 15:18:19,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:19,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:19,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:18:19,620 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:19,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1040276822, now seen corresponding path program 1 times [2025-03-03 15:18:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:19,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639094271] [2025-03-03 15:18:19,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:19,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 15:18:19,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 15:18:19,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:19,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:19,828 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:18:19,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639094271] [2025-03-03 15:18:19,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639094271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964026204] [2025-03-03 15:18:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:18:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:19,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:18:19,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:18:19,830 INFO L87 Difference]: Start difference. First operand 7563 states and 10977 transitions. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:18:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:20,264 INFO L93 Difference]: Finished difference Result 22520 states and 32670 transitions. [2025-03-03 15:18:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:20,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-03 15:18:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:20,285 INFO L225 Difference]: With dead ends: 22520 [2025-03-03 15:18:20,286 INFO L226 Difference]: Without dead ends: 15126 [2025-03-03 15:18:20,293 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:18:20,294 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1221 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:20,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 737 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:18:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15126 states. [2025-03-03 15:18:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15126 to 7563. [2025-03-03 15:18:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7563 states, 7562 states have (on average 1.4508066649034648) internal successors, (10971), 7562 states have internal predecessors, (10971), 0 states have call successors, (0), 0 states 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:18:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7563 states to 7563 states and 10971 transitions. [2025-03-03 15:18:20,392 INFO L78 Accepts]: Start accepts. Automaton has 7563 states and 10971 transitions. Word has length 121 [2025-03-03 15:18:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:20,392 INFO L471 AbstractCegarLoop]: Abstraction has 7563 states and 10971 transitions. [2025-03-03 15:18:20,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:18:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7563 states and 10971 transitions. [2025-03-03 15:18:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 15:18:20,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:20,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:20,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:18:20,394 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:20,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1101829994, now seen corresponding path program 1 times [2025-03-03 15:18:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353200799] [2025-03-03 15:18:20,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:20,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 15:18:20,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 15:18:20,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:20,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:20,846 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:18:20,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:20,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353200799] [2025-03-03 15:18:20,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353200799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:20,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599267005] [2025-03-03 15:18:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:20,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:20,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:20,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:20,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:20,848 INFO L87 Difference]: Start difference. First operand 7563 states and 10971 transitions. Second operand has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:18:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:21,700 INFO L93 Difference]: Finished difference Result 51504 states and 74599 transitions. [2025-03-03 15:18:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:18:21,701 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-03 15:18:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:21,762 INFO L225 Difference]: With dead ends: 51504 [2025-03-03 15:18:21,763 INFO L226 Difference]: Without dead ends: 44140 [2025-03-03 15:18:21,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:18:21,782 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 3637 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3637 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:21,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3637 Valid, 1036 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:18:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44140 states. [2025-03-03 15:18:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44140 to 7581. [2025-03-03 15:18:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7581 states, 7580 states have (on average 1.44934036939314) internal successors, (10986), 7580 states have internal predecessors, (10986), 0 states have call successors, (0), 0 states 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:18:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7581 states to 7581 states and 10986 transitions. [2025-03-03 15:18:22,102 INFO L78 Accepts]: Start accepts. Automaton has 7581 states and 10986 transitions. Word has length 122 [2025-03-03 15:18:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:22,102 INFO L471 AbstractCegarLoop]: Abstraction has 7581 states and 10986 transitions. [2025-03-03 15:18:22,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:18:22,102 INFO L276 IsEmpty]: Start isEmpty. Operand 7581 states and 10986 transitions. [2025-03-03 15:18:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:22,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:22,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:22,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:18:22,103 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:22,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1895973716, now seen corresponding path program 1 times [2025-03-03 15:18:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:22,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572672128] [2025-03-03 15:18:22,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:22,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:22,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:22,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:22,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:22,385 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:18:22,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:22,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572672128] [2025-03-03 15:18:22,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572672128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:22,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234639951] [2025-03-03 15:18:22,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:22,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:18:22,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:22,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:18:22,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:18:22,387 INFO L87 Difference]: Start difference. First operand 7581 states and 10986 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:22,927 INFO L93 Difference]: Finished difference Result 22378 states and 32437 transitions. [2025-03-03 15:18:22,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:22,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:22,944 INFO L225 Difference]: With dead ends: 22378 [2025-03-03 15:18:22,944 INFO L226 Difference]: Without dead ends: 15104 [2025-03-03 15:18:22,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:18:22,952 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 712 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:22,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1023 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:18:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15104 states. [2025-03-03 15:18:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15104 to 7502. [2025-03-03 15:18:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7502 states, 7501 states have (on average 1.4499400079989335) internal successors, (10876), 7501 states have internal predecessors, (10876), 0 states have call successors, (0), 0 states 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:18:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7502 states to 7502 states and 10876 transitions. [2025-03-03 15:18:23,110 INFO L78 Accepts]: Start accepts. Automaton has 7502 states and 10876 transitions. Word has length 123 [2025-03-03 15:18:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:23,111 INFO L471 AbstractCegarLoop]: Abstraction has 7502 states and 10876 transitions. [2025-03-03 15:18:23,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7502 states and 10876 transitions. [2025-03-03 15:18:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:23,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:23,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:23,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:18:23,113 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2091912962, now seen corresponding path program 1 times [2025-03-03 15:18:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109551674] [2025-03-03 15:18:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:23,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:23,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:23,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:23,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:23,455 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:18:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109551674] [2025-03-03 15:18:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109551674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:23,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:23,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:23,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271434935] [2025-03-03 15:18:23,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:23,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:18:23,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:23,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:18:23,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:18:23,457 INFO L87 Difference]: Start difference. First operand 7502 states and 10876 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:23,929 INFO L93 Difference]: Finished difference Result 22159 states and 32120 transitions. [2025-03-03 15:18:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:23,946 INFO L225 Difference]: With dead ends: 22159 [2025-03-03 15:18:23,947 INFO L226 Difference]: Without dead ends: 14794 [2025-03-03 15:18:23,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:18:23,954 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1153 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:23,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 982 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:18:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14794 states. [2025-03-03 15:18:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14794 to 7502. [2025-03-03 15:18:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7502 states, 7501 states have (on average 1.4496733768830823) internal successors, (10874), 7501 states have internal predecessors, (10874), 0 states have call successors, (0), 0 states 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:18:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7502 states to 7502 states and 10874 transitions. [2025-03-03 15:18:24,055 INFO L78 Accepts]: Start accepts. Automaton has 7502 states and 10874 transitions. Word has length 123 [2025-03-03 15:18:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:24,055 INFO L471 AbstractCegarLoop]: Abstraction has 7502 states and 10874 transitions. [2025-03-03 15:18:24,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 7502 states and 10874 transitions. [2025-03-03 15:18:24,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:24,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:24,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:24,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:18:24,056 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1464114736, now seen corresponding path program 1 times [2025-03-03 15:18:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506323441] [2025-03-03 15:18:24,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:24,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:24,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:24,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:24,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:24,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:24,286 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:18:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506323441] [2025-03-03 15:18:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506323441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:24,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:24,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59911571] [2025-03-03 15:18:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:24,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:18:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:24,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:18:24,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:18:24,287 INFO L87 Difference]: Start difference. First operand 7502 states and 10874 transitions. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:24,772 INFO L93 Difference]: Finished difference Result 22361 states and 32417 transitions. [2025-03-03 15:18:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:24,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:18:24,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:24,787 INFO L225 Difference]: With dead ends: 22361 [2025-03-03 15:18:24,788 INFO L226 Difference]: Without dead ends: 15046 [2025-03-03 15:18:24,795 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:18:24,795 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 678 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:24,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1061 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:18:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15046 states. [2025-03-03 15:18:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15046 to 7490. [2025-03-03 15:18:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7490 states, 7489 states have (on average 1.4498597943650688) internal successors, (10858), 7489 states have internal predecessors, (10858), 0 states have call successors, (0), 0 states 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:18:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7490 states to 7490 states and 10858 transitions. [2025-03-03 15:18:24,894 INFO L78 Accepts]: Start accepts. Automaton has 7490 states and 10858 transitions. Word has length 124 [2025-03-03 15:18:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:24,895 INFO L471 AbstractCegarLoop]: Abstraction has 7490 states and 10858 transitions. [2025-03-03 15:18:24,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 7490 states and 10858 transitions. [2025-03-03 15:18:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:24,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:24,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:24,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:18:24,896 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:24,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -647753542, now seen corresponding path program 1 times [2025-03-03 15:18:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:24,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897460054] [2025-03-03 15:18:24,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:24,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:24,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:24,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:24,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:24,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:25,746 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:18:25,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:25,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897460054] [2025-03-03 15:18:25,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897460054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:25,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:25,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 15:18:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773096859] [2025-03-03 15:18:25,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:25,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 15:18:25,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:25,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 15:18:25,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:25,748 INFO L87 Difference]: Start difference. First operand 7490 states and 10858 transitions. Second operand has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 19 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:26,899 INFO L93 Difference]: Finished difference Result 23674 states and 34419 transitions. [2025-03-03 15:18:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 15:18:26,899 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 19 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:18:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:26,916 INFO L225 Difference]: With dead ends: 23674 [2025-03-03 15:18:26,917 INFO L226 Difference]: Without dead ends: 21930 [2025-03-03 15:18:26,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1118, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 15:18:26,925 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1589 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 4599 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:26,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 4599 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:18:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21930 states. [2025-03-03 15:18:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21930 to 7490. [2025-03-03 15:18:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7490 states, 7489 states have (on average 1.4493256776605687) internal successors, (10854), 7489 states have internal predecessors, (10854), 0 states have call successors, (0), 0 states 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:18:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7490 states to 7490 states and 10854 transitions. [2025-03-03 15:18:27,063 INFO L78 Accepts]: Start accepts. Automaton has 7490 states and 10854 transitions. Word has length 124 [2025-03-03 15:18:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:27,063 INFO L471 AbstractCegarLoop]: Abstraction has 7490 states and 10854 transitions. [2025-03-03 15:18:27,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 19 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 7490 states and 10854 transitions. [2025-03-03 15:18:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:27,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:27,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:27,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:18:27,064 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:27,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1057824402, now seen corresponding path program 1 times [2025-03-03 15:18:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:27,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311156594] [2025-03-03 15:18:27,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:27,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:27,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:27,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:27,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:27,494 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:18:27,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:27,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311156594] [2025-03-03 15:18:27,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311156594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:27,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:27,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325059624] [2025-03-03 15:18:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:27,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:27,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:27,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:27,495 INFO L87 Difference]: Start difference. First operand 7490 states and 10854 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:27,989 INFO L93 Difference]: Finished difference Result 16550 states and 24049 transitions. [2025-03-03 15:18:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:27,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:18:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:28,003 INFO L225 Difference]: With dead ends: 16550 [2025-03-03 15:18:28,004 INFO L226 Difference]: Without dead ends: 14806 [2025-03-03 15:18:28,009 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:18:28,009 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 916 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:28,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 2799 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14806 states. [2025-03-03 15:18:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14806 to 7471. [2025-03-03 15:18:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7471 states, 7470 states have (on average 1.4493975903614458) internal successors, (10827), 7470 states have internal predecessors, (10827), 0 states have call successors, (0), 0 states 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:18:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7471 states to 7471 states and 10827 transitions. [2025-03-03 15:18:28,157 INFO L78 Accepts]: Start accepts. Automaton has 7471 states and 10827 transitions. Word has length 124 [2025-03-03 15:18:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:28,157 INFO L471 AbstractCegarLoop]: Abstraction has 7471 states and 10827 transitions. [2025-03-03 15:18:28,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7471 states and 10827 transitions. [2025-03-03 15:18:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:28,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:28,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:28,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:18:28,159 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:28,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 455835141, now seen corresponding path program 1 times [2025-03-03 15:18:28,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:28,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032601707] [2025-03-03 15:18:28,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:28,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:28,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:28,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:28,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:28,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:31,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:31,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032601707] [2025-03-03 15:18:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032601707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:31,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:31,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2025-03-03 15:18:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256005059] [2025-03-03 15:18:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 15:18:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:31,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 15:18:31,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1925, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 15:18:31,127 INFO L87 Difference]: Start difference. First operand 7471 states and 10827 transitions. Second operand has 46 states, 46 states have (on average 2.6956521739130435) internal successors, (124), 46 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:40,438 INFO L93 Difference]: Finished difference Result 52242 states and 76014 transitions. [2025-03-03 15:18:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 15:18:40,439 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.6956521739130435) internal successors, (124), 46 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:18:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:40,492 INFO L225 Difference]: With dead ends: 52242 [2025-03-03 15:18:40,492 INFO L226 Difference]: Without dead ends: 51388 [2025-03-03 15:18:40,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 15:18:40,508 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 2820 mSDsluCounter, 17020 mSDsCounter, 0 mSdLazyCounter, 12449 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2820 SdHoareTripleChecker+Valid, 17744 SdHoareTripleChecker+Invalid, 12485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 12449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:40,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2820 Valid, 17744 Invalid, 12485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 12449 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-03 15:18:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51388 states. [2025-03-03 15:18:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51388 to 7512. [2025-03-03 15:18:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7512 states, 7511 states have (on average 1.4486752762614832) internal successors, (10881), 7511 states have internal predecessors, (10881), 0 states have call successors, (0), 0 states 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:18:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 10881 transitions. [2025-03-03 15:18:40,757 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 10881 transitions. Word has length 124 [2025-03-03 15:18:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:40,758 INFO L471 AbstractCegarLoop]: Abstraction has 7512 states and 10881 transitions. [2025-03-03 15:18:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.6956521739130435) internal successors, (124), 46 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 10881 transitions. [2025-03-03 15:18:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:40,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:40,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:40,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:18:40,759 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1906593818, now seen corresponding path program 1 times [2025-03-03 15:18:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:40,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235637241] [2025-03-03 15:18:40,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:40,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:40,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:40,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:40,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:41,140 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:18:41,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:41,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235637241] [2025-03-03 15:18:41,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235637241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:41,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:41,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:41,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279223259] [2025-03-03 15:18:41,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:41,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:41,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:41,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:41,141 INFO L87 Difference]: Start difference. First operand 7512 states and 10881 transitions. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:41,491 INFO L93 Difference]: Finished difference Result 29952 states and 43593 transitions. [2025-03-03 15:18:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:41,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:18:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:41,519 INFO L225 Difference]: With dead ends: 29952 [2025-03-03 15:18:41,519 INFO L226 Difference]: Without dead ends: 28152 [2025-03-03 15:18:41,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:18:41,529 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1507 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:41,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1882 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28152 states. [2025-03-03 15:18:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28152 to 7154. [2025-03-03 15:18:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7154 states, 7153 states have (on average 1.4503005731860759) internal successors, (10374), 7153 states have internal predecessors, (10374), 0 states have call successors, (0), 0 states 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:18:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7154 states to 7154 states and 10374 transitions. [2025-03-03 15:18:41,689 INFO L78 Accepts]: Start accepts. Automaton has 7154 states and 10374 transitions. Word has length 124 [2025-03-03 15:18:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:41,689 INFO L471 AbstractCegarLoop]: Abstraction has 7154 states and 10374 transitions. [2025-03-03 15:18:41,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7154 states and 10374 transitions. [2025-03-03 15:18:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:41,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:41,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:41,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:18:41,690 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:41,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash -427752499, now seen corresponding path program 1 times [2025-03-03 15:18:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:41,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968574551] [2025-03-03 15:18:41,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:41,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:41,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:41,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:41,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:42,123 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:18:42,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968574551] [2025-03-03 15:18:42,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968574551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:42,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:42,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:42,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462805754] [2025-03-03 15:18:42,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:42,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:42,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:42,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:42,124 INFO L87 Difference]: Start difference. First operand 7154 states and 10374 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:42,520 INFO L93 Difference]: Finished difference Result 15868 states and 23075 transitions. [2025-03-03 15:18:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:18:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:42,535 INFO L225 Difference]: With dead ends: 15868 [2025-03-03 15:18:42,535 INFO L226 Difference]: Without dead ends: 14154 [2025-03-03 15:18:42,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:18:42,541 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1256 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:42,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1548 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14154 states. [2025-03-03 15:18:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14154 to 7150. [2025-03-03 15:18:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7150 states, 7149 states have (on average 1.4498531263113723) internal successors, (10365), 7149 states have internal predecessors, (10365), 0 states have call successors, (0), 0 states 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:18:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 10365 transitions. [2025-03-03 15:18:42,642 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 10365 transitions. Word has length 124 [2025-03-03 15:18:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:42,642 INFO L471 AbstractCegarLoop]: Abstraction has 7150 states and 10365 transitions. [2025-03-03 15:18:42,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 10365 transitions. [2025-03-03 15:18:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:42,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:42,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:42,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:18:42,643 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:42,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash -804529499, now seen corresponding path program 1 times [2025-03-03 15:18:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349380434] [2025-03-03 15:18:42,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:42,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:42,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:42,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:42,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:43,156 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:18:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349380434] [2025-03-03 15:18:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349380434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:43,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:18:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767243864] [2025-03-03 15:18:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:43,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:18:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:43,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:18:43,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:43,158 INFO L87 Difference]: Start difference. First operand 7150 states and 10365 transitions. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:43,876 INFO L93 Difference]: Finished difference Result 29851 states and 43446 transitions. [2025-03-03 15:18:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:18:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:18:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:43,906 INFO L225 Difference]: With dead ends: 29851 [2025-03-03 15:18:43,906 INFO L226 Difference]: Without dead ends: 28127 [2025-03-03 15:18:43,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:18:43,916 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1091 mSDsluCounter, 3107 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:43,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 3473 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28127 states. [2025-03-03 15:18:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28127 to 7141. [2025-03-03 15:18:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7141 states, 7140 states have (on average 1.449719887955182) internal successors, (10351), 7140 states have internal predecessors, (10351), 0 states have call successors, (0), 0 states 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:18:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 10351 transitions. [2025-03-03 15:18:44,103 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 10351 transitions. Word has length 124 [2025-03-03 15:18:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:44,103 INFO L471 AbstractCegarLoop]: Abstraction has 7141 states and 10351 transitions. [2025-03-03 15:18:44,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 10351 transitions. [2025-03-03 15:18:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:44,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:44,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:44,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:18:44,104 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:44,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1205893763, now seen corresponding path program 1 times [2025-03-03 15:18:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:44,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338207993] [2025-03-03 15:18:44,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:44,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:44,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:44,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:44,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:44,632 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:18:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338207993] [2025-03-03 15:18:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338207993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:44,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265202453] [2025-03-03 15:18:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:44,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:44,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:44,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:44,634 INFO L87 Difference]: Start difference. First operand 7141 states and 10351 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:45,035 INFO L93 Difference]: Finished difference Result 15834 states and 23027 transitions. [2025-03-03 15:18:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:45,035 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 15:18:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:45,048 INFO L225 Difference]: With dead ends: 15834 [2025-03-03 15:18:45,048 INFO L226 Difference]: Without dead ends: 14100 [2025-03-03 15:18:45,052 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:18:45,053 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1100 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:45,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1773 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14100 states. [2025-03-03 15:18:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14100 to 7113. [2025-03-03 15:18:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7112 states have (on average 1.450646794150731) internal successors, (10317), 7112 states have internal predecessors, (10317), 0 states have call successors, (0), 0 states 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:18:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 10317 transitions. [2025-03-03 15:18:45,137 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 10317 transitions. Word has length 124 [2025-03-03 15:18:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:45,137 INFO L471 AbstractCegarLoop]: Abstraction has 7113 states and 10317 transitions. [2025-03-03 15:18:45,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:18:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 10317 transitions. [2025-03-03 15:18:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:18:45,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:45,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:45,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:18:45,138 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:45,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1763885619, now seen corresponding path program 1 times [2025-03-03 15:18:45,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:45,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597510915] [2025-03-03 15:18:45,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:45,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:18:45,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:18:45,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:45,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:45,632 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:18:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597510915] [2025-03-03 15:18:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597510915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:45,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:18:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071978434] [2025-03-03 15:18:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:45,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:18:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:45,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:18:45,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:45,634 INFO L87 Difference]: Start difference. First operand 7113 states and 10317 transitions. Second operand has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:18:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:46,199 INFO L93 Difference]: Finished difference Result 29739 states and 43318 transitions. [2025-03-03 15:18:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:18:46,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:18:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:46,226 INFO L225 Difference]: With dead ends: 29739 [2025-03-03 15:18:46,226 INFO L226 Difference]: Without dead ends: 28033 [2025-03-03 15:18:46,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:18:46,236 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1033 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 5050 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:46,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 5050 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28033 states. [2025-03-03 15:18:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28033 to 7117. [2025-03-03 15:18:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7117 states, 7116 states have (on average 1.4506745362563238) internal successors, (10323), 7116 states have internal predecessors, (10323), 0 states have call successors, (0), 0 states 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:18:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7117 states to 7117 states and 10323 transitions. [2025-03-03 15:18:46,398 INFO L78 Accepts]: Start accepts. Automaton has 7117 states and 10323 transitions. Word has length 125 [2025-03-03 15:18:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:46,398 INFO L471 AbstractCegarLoop]: Abstraction has 7117 states and 10323 transitions. [2025-03-03 15:18:46,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:18:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 7117 states and 10323 transitions. [2025-03-03 15:18:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:18:46,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:46,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:18:46,399 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:46,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1618430059, now seen corresponding path program 1 times [2025-03-03 15:18:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:46,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497277043] [2025-03-03 15:18:46,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:46,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:18:46,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:18:46,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:46,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:46,620 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:18:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:46,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497277043] [2025-03-03 15:18:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497277043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:46,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:46,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:18:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688242095] [2025-03-03 15:18:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:46,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:46,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:46,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:46,622 INFO L87 Difference]: Start difference. First operand 7117 states and 10323 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:18:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:46,647 INFO L93 Difference]: Finished difference Result 7151 states and 10372 transitions. [2025-03-03 15:18:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:46,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:18:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:46,653 INFO L225 Difference]: With dead ends: 7151 [2025-03-03 15:18:46,653 INFO L226 Difference]: Without dead ends: 7149 [2025-03-03 15:18:46,655 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:18:46,655 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:46,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 957 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7149 states. [2025-03-03 15:18:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7149 to 7149. [2025-03-03 15:18:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7149 states, 7148 states have (on average 1.4439003917179631) internal successors, (10321), 7148 states have internal predecessors, (10321), 0 states have call successors, (0), 0 states 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:18:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7149 states to 7149 states and 10321 transitions. [2025-03-03 15:18:46,709 INFO L78 Accepts]: Start accepts. Automaton has 7149 states and 10321 transitions. Word has length 125 [2025-03-03 15:18:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:46,710 INFO L471 AbstractCegarLoop]: Abstraction has 7149 states and 10321 transitions. [2025-03-03 15:18:46,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:18:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 7149 states and 10321 transitions. [2025-03-03 15:18:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 15:18:46,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:46,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:18:46,710 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:46,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1708386458, now seen corresponding path program 1 times [2025-03-03 15:18:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:46,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942144760] [2025-03-03 15:18:46,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:46,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 15:18:46,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 15:18:46,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:46,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:47,135 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:18:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942144760] [2025-03-03 15:18:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942144760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:47,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:47,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845126667] [2025-03-03 15:18:47,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:47,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:47,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:47,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:47,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:47,137 INFO L87 Difference]: Start difference. First operand 7149 states and 10321 transitions. Second operand has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 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:18:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:47,578 INFO L93 Difference]: Finished difference Result 15894 states and 23010 transitions. [2025-03-03 15:18:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:47,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 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 126 [2025-03-03 15:18:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:47,590 INFO L225 Difference]: With dead ends: 15894 [2025-03-03 15:18:47,591 INFO L226 Difference]: Without dead ends: 14154 [2025-03-03 15:18:47,595 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:18:47,596 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1098 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:47,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1980 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14154 states. [2025-03-03 15:18:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14154 to 7123. [2025-03-03 15:18:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7123 states, 7122 states have (on average 1.4448188711036225) internal successors, (10290), 7122 states have internal predecessors, (10290), 0 states have call successors, (0), 0 states 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:18:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7123 states to 7123 states and 10290 transitions. [2025-03-03 15:18:47,689 INFO L78 Accepts]: Start accepts. Automaton has 7123 states and 10290 transitions. Word has length 126 [2025-03-03 15:18:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:47,690 INFO L471 AbstractCegarLoop]: Abstraction has 7123 states and 10290 transitions. [2025-03-03 15:18:47,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 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:18:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7123 states and 10290 transitions. [2025-03-03 15:18:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 15:18:47,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:47,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:47,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:18:47,691 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:47,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash -615792508, now seen corresponding path program 1 times [2025-03-03 15:18:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314574223] [2025-03-03 15:18:47,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:47,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 15:18:47,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 15:18:47,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:47,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314574223] [2025-03-03 15:18:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314574223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:47,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:47,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:18:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102833552] [2025-03-03 15:18:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:47,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:18:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:47,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:18:47,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:18:47,777 INFO L87 Difference]: Start difference. First operand 7123 states and 10290 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:18:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:47,843 INFO L93 Difference]: Finished difference Result 14789 states and 21409 transitions. [2025-03-03 15:18:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:18:47,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-03 15:18:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:47,851 INFO L225 Difference]: With dead ends: 14789 [2025-03-03 15:18:47,851 INFO L226 Difference]: Without dead ends: 9875 [2025-03-03 15:18:47,855 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:18:47,855 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 109 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 536 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:18:47,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 536 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9875 states. [2025-03-03 15:18:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9875 to 9597. [2025-03-03 15:18:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9597 states, 9596 states have (on average 1.4417465610671112) internal successors, (13835), 9596 states have internal predecessors, (13835), 0 states have call successors, (0), 0 states 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:18:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9597 states to 9597 states and 13835 transitions. [2025-03-03 15:18:47,975 INFO L78 Accepts]: Start accepts. Automaton has 9597 states and 13835 transitions. Word has length 161 [2025-03-03 15:18:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:47,975 INFO L471 AbstractCegarLoop]: Abstraction has 9597 states and 13835 transitions. [2025-03-03 15:18:47,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:18:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9597 states and 13835 transitions. [2025-03-03 15:18:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:18:47,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:47,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:47,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:18:47,976 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:47,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:47,977 INFO L85 PathProgramCache]: Analyzing trace with hash -797901162, now seen corresponding path program 1 times [2025-03-03 15:18:47,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:47,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937424127] [2025-03-03 15:18:47,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:47,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:47,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:18:48,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:18:48,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:48,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:48,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:48,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937424127] [2025-03-03 15:18:48,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937424127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:48,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:48,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:48,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026169641] [2025-03-03 15:18:48,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:48,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:48,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:48,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:48,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:48,123 INFO L87 Difference]: Start difference. First operand 9597 states and 13835 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:18:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:48,413 INFO L93 Difference]: Finished difference Result 40933 states and 59573 transitions. [2025-03-03 15:18:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:48,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-03 15:18:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:48,440 INFO L225 Difference]: With dead ends: 40933 [2025-03-03 15:18:48,440 INFO L226 Difference]: Without dead ends: 31469 [2025-03-03 15:18:48,448 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:18:48,448 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1417 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:48,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31469 states. [2025-03-03 15:18:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31469 to 20379. [2025-03-03 15:18:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20379 states, 20378 states have (on average 1.4416036902541958) internal successors, (29377), 20378 states have internal predecessors, (29377), 0 states have call successors, (0), 0 states 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:18:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20379 states to 20379 states and 29377 transitions. [2025-03-03 15:18:48,652 INFO L78 Accepts]: Start accepts. Automaton has 20379 states and 29377 transitions. Word has length 163 [2025-03-03 15:18:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:48,652 INFO L471 AbstractCegarLoop]: Abstraction has 20379 states and 29377 transitions. [2025-03-03 15:18:48,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:18:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 20379 states and 29377 transitions. [2025-03-03 15:18:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:18:48,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:48,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:48,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:18:48,653 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:48,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1916303190, now seen corresponding path program 1 times [2025-03-03 15:18:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:48,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122325053] [2025-03-03 15:18:48,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:48,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:18:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:18:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:48,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:48,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122325053] [2025-03-03 15:18:48,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122325053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:48,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:48,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:48,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728102646] [2025-03-03 15:18:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:48,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:48,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:48,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:48,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:48,775 INFO L87 Difference]: Start difference. First operand 20379 states and 29377 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:18:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:49,039 INFO L93 Difference]: Finished difference Result 80407 states and 116627 transitions. [2025-03-03 15:18:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-03 15:18:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:49,097 INFO L225 Difference]: With dead ends: 80407 [2025-03-03 15:18:49,097 INFO L226 Difference]: Without dead ends: 60161 [2025-03-03 15:18:49,121 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:18:49,121 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1332 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:49,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 484 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60161 states. [2025-03-03 15:18:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60161 to 43263. [2025-03-03 15:18:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43263 states, 43262 states have (on average 1.4402709074938744) internal successors, (62309), 43262 states have internal predecessors, (62309), 0 states have call successors, (0), 0 states 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:18:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43263 states to 43263 states and 62309 transitions. [2025-03-03 15:18:49,704 INFO L78 Accepts]: Start accepts. Automaton has 43263 states and 62309 transitions. Word has length 163 [2025-03-03 15:18:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:49,704 INFO L471 AbstractCegarLoop]: Abstraction has 43263 states and 62309 transitions. [2025-03-03 15:18:49,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:18:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 43263 states and 62309 transitions. [2025-03-03 15:18:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:18:49,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:49,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:49,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:18:49,706 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:49,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1033823178, now seen corresponding path program 1 times [2025-03-03 15:18:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:49,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725069151] [2025-03-03 15:18:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:49,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:18:49,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:18:49,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:49,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:49,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:49,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725069151] [2025-03-03 15:18:49,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725069151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:49,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:49,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525690552] [2025-03-03 15:18:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:49,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:49,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:49,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:49,804 INFO L87 Difference]: Start difference. First operand 43263 states and 62309 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:18:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:50,269 INFO L93 Difference]: Finished difference Result 158035 states and 228359 transitions. [2025-03-03 15:18:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:50,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-03 15:18:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:50,400 INFO L225 Difference]: With dead ends: 158035 [2025-03-03 15:18:50,401 INFO L226 Difference]: Without dead ends: 114905 [2025-03-03 15:18:50,566 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:18:50,567 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1247 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:50,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 482 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114905 states. [2025-03-03 15:18:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114905 to 91671. [2025-03-03 15:18:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91671 states, 91670 states have (on average 1.4385185993236609) internal successors, (131869), 91670 states have internal predecessors, (131869), 0 states have call successors, (0), 0 states 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:18:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91671 states to 91671 states and 131869 transitions. [2025-03-03 15:18:51,692 INFO L78 Accepts]: Start accepts. Automaton has 91671 states and 131869 transitions. Word has length 163 [2025-03-03 15:18:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:51,692 INFO L471 AbstractCegarLoop]: Abstraction has 91671 states and 131869 transitions. [2025-03-03 15:18:51,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:18:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 91671 states and 131869 transitions. [2025-03-03 15:18:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:18:51,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:51,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:51,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:18:51,695 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:51,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1221823822, now seen corresponding path program 1 times [2025-03-03 15:18:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:51,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695214443] [2025-03-03 15:18:51,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:51,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:18:51,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:18:51,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:51,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695214443] [2025-03-03 15:18:51,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695214443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:51,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:51,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303732639] [2025-03-03 15:18:51,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:51,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:51,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:51,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:51,840 INFO L87 Difference]: Start difference. First operand 91671 states and 131869 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:18:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:52,674 INFO L93 Difference]: Finished difference Result 310651 states and 447071 transitions. [2025-03-03 15:18:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-03 15:18:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:52,976 INFO L225 Difference]: With dead ends: 310651 [2025-03-03 15:18:52,976 INFO L226 Difference]: Without dead ends: 219113 [2025-03-03 15:18:53,074 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:18:53,074 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1162 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:53,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 480 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219113 states. [2025-03-03 15:18:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219113 to 193767. [2025-03-03 15:18:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193767 states, 193766 states have (on average 1.4366865187907063) internal successors, (278381), 193766 states have internal predecessors, (278381), 0 states have call successors, (0), 0 states 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:18:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193767 states to 193767 states and 278381 transitions. [2025-03-03 15:18:55,937 INFO L78 Accepts]: Start accepts. Automaton has 193767 states and 278381 transitions. Word has length 163 [2025-03-03 15:18:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:55,937 INFO L471 AbstractCegarLoop]: Abstraction has 193767 states and 278381 transitions. [2025-03-03 15:18:55,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:18:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 193767 states and 278381 transitions. [2025-03-03 15:18:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:18:55,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:55,944 INFO L218 NwaCegarLoop]: trace histogram [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, 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:18:55,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:18:55,945 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:55,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash -67966100, now seen corresponding path program 1 times [2025-03-03 15:18:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286631318] [2025-03-03 15:18:55,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:55,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:18:56,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:18:56,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:56,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286631318] [2025-03-03 15:18:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286631318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:18:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298403771] [2025-03-03 15:18:56,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:56,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:18:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:18:56,239 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:18:56,241 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:18:56,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:18:56,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:18:56,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:56,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:56,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:18:56,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:18:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:57,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:18:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:57,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298403771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:18:57,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:18:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:18:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399810811] [2025-03-03 15:18:57,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:18:57,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:18:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:57,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:18:57,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:18:57,270 INFO L87 Difference]: Start difference. First operand 193767 states and 278381 transitions. Second operand has 11 states, 11 states have (on average 26.454545454545453) internal successors, (291), 10 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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:18:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:59,198 INFO L93 Difference]: Finished difference Result 610603 states and 874991 transitions. [2025-03-03 15:18:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:59,198 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 26.454545454545453) internal successors, (291), 10 states have internal predecessors, (291), 0 states have call successors, (0), 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 163 [2025-03-03 15:18:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:59,734 INFO L225 Difference]: With dead ends: 610603 [2025-03-03 15:18:59,735 INFO L226 Difference]: Without dead ends: 416969 [2025-03-03 15:18:59,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 316 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:18:59,790 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1449 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:59,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 533 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:19:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416969 states. [2025-03-03 15:19:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416969 to 406407. [2025-03-03 15:19:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406407 states, 406406 states have (on average 1.4267825770288824) internal successors, (579853), 406406 states have internal predecessors, (579853), 0 states have call successors, (0), 0 states 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:19:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406407 states to 406407 states and 579853 transitions. [2025-03-03 15:19:05,361 INFO L78 Accepts]: Start accepts. Automaton has 406407 states and 579853 transitions. Word has length 163 [2025-03-03 15:19:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:05,361 INFO L471 AbstractCegarLoop]: Abstraction has 406407 states and 579853 transitions. [2025-03-03 15:19:05,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.454545454545453) internal successors, (291), 10 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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:19:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 406407 states and 579853 transitions. [2025-03-03 15:19:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:19:05,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:05,363 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 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:19:05,374 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:19:05,564 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,SelfDestructingSolverStorable43 [2025-03-03 15:19:05,564 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:05,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1251653428, now seen corresponding path program 1 times [2025-03-03 15:19:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321844886] [2025-03-03 15:19:05,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:05,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:19:05,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:19:05,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:05,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:05,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:05,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321844886] [2025-03-03 15:19:05,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321844886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:05,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:05,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:19:05,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651243366] [2025-03-03 15:19:05,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:05,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:19:05,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:05,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:19:05,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:19:05,667 INFO L87 Difference]: Start difference. First operand 406407 states and 579853 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:19:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:08,402 INFO L93 Difference]: Finished difference Result 920222 states and 1314533 transitions. [2025-03-03 15:19:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:19:08,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-03 15:19:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:09,202 INFO L225 Difference]: With dead ends: 920222 [2025-03-03 15:19:09,203 INFO L226 Difference]: Without dead ends: 513948 [2025-03-03 15:19:09,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:19:09,421 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1241 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:09,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 552 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:19:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513948 states. [2025-03-03 15:19:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513948 to 426000. [2025-03-03 15:19:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426000 states, 425999 states have (on average 1.4224845598229103) internal successors, (605977), 425999 states have internal predecessors, (605977), 0 states have call successors, (0), 0 states 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:19:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426000 states to 426000 states and 605977 transitions. [2025-03-03 15:19:15,609 INFO L78 Accepts]: Start accepts. Automaton has 426000 states and 605977 transitions. Word has length 163 [2025-03-03 15:19:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:15,609 INFO L471 AbstractCegarLoop]: Abstraction has 426000 states and 605977 transitions. [2025-03-03 15:19:15,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:19:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 426000 states and 605977 transitions. [2025-03-03 15:19:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 15:19:15,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:15,654 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 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, 1, 1] [2025-03-03 15:19:15,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:19:15,655 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash -702522696, now seen corresponding path program 1 times [2025-03-03 15:19:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680238253] [2025-03-03 15:19:15,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:15,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 15:19:15,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 15:19:15,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:15,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 15:19:15,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:15,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680238253] [2025-03-03 15:19:15,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680238253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:15,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:15,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:19:15,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876589899] [2025-03-03 15:19:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:15,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:19:15,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:15,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:19:15,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:15,814 INFO L87 Difference]: Start difference. First operand 426000 states and 605977 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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:19:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:18,574 INFO L93 Difference]: Finished difference Result 829588 states and 1177883 transitions. [2025-03-03 15:19:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:19:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 198 [2025-03-03 15:19:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:19,228 INFO L225 Difference]: With dead ends: 829588 [2025-03-03 15:19:19,228 INFO L226 Difference]: Without dead ends: 403727 [2025-03-03 15:19:19,389 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:19:19,389 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 102 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 522 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:19:19,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 522 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:19:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403727 states.