./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d2ed0f37ff2caecb0f852b41838696d35f940cfb2007be63d1246f35f6e95b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:33:48,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:33:48,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:33:48,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:33:48,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:33:48,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:33:48,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:33:48,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:33:48,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:33:48,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:33:48,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:33:48,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:33:48,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:33:48,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:33:48,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:33:48,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:33:48,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:33:48,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:33:48,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:33:48,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:33:48,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:33:48,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:33:48,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:33:48,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:33:48,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:33:48,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:33:48,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:33:48,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:33:48,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:33:48,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:33:48,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:33:48,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:33:48,975 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 -> 1d2ed0f37ff2caecb0f852b41838696d35f940cfb2007be63d1246f35f6e95b8 [2025-03-16 19:33:49,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:33:49,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:33:49,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:33:49,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:33:49,199 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:33:49,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-16 19:33:50,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d6bca6ea/3619c15c135a43dea000681e10fb8e19/FLAG34e6547b9 [2025-03-16 19:33:50,629 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:33:50,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-16 19:33:50,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d6bca6ea/3619c15c135a43dea000681e10fb8e19/FLAG34e6547b9 [2025-03-16 19:33:50,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d6bca6ea/3619c15c135a43dea000681e10fb8e19 [2025-03-16 19:33:50,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:33:50,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:33:50,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:33:50,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:33:50,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:33:50,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:33:50" (1/1) ... [2025-03-16 19:33:50,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40eb77c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:50, skipping insertion in model container [2025-03-16 19:33:50,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:33:50" (1/1) ... [2025-03-16 19:33:50,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:33:51,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[14220,14233] [2025-03-16 19:33:51,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:33:51,211 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:33:51,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[14220,14233] [2025-03-16 19:33:51,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:33:51,314 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:33:51,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51 WrapperNode [2025-03-16 19:33:51,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:33:51,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:33:51,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:33:51,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:33:51,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,360 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1287 [2025-03-16 19:33:51,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:33:51,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:33:51,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:33:51,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:33:51,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,389 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:33:51,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:33:51,413 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:33:51,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:33:51,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:33:51,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (1/1) ... [2025-03-16 19:33:51,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:33:51,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:33:51,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:33:51,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:33:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:33:51,582 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:33:51,583 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:33:52,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L993: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc main_~node3__m3~3#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L234: havoc main_~node2__m2~0#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: havoc main_~node2__m2~2#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1391: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L797: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: havoc main_~node4__m4~4#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:33:52,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657: havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923: havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: havoc main_~node2__m2~4#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1792: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2058: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L903: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1170: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:52,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1038: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: havoc main_~node5__m5~0#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L511: havoc main_~node5__m5~2#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1436: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L380: havoc main_~node4__m4~1#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1305: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1702: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L612: havoc main_~node4__m4~3#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: havoc main_~node3__m3~0#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1571: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: havoc main_~node3__m3~2#1; [2025-03-16 19:33:52,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1968: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: havoc main_~node5__m5~4#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L350: havoc main_~node2__m2~1#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1837: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L582: havoc main_~node2__m2~3#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2103: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: havoc main_~node3__m3~4#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1215: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:52,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1481: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1747: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2013: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L395: havoc main_~node5__m5~1#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L858: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc main_~node5__m5~3#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: havoc main_~node4__m4~0#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: havoc main_~node4__m4~2#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc main_~node3__m3~1#1; [2025-03-16 19:33:52,409 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:52,455 INFO L? ?]: Removed 191 outVars from TransFormulas that were not future-live. [2025-03-16 19:33:52,456 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:33:52,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:33:52,469 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:33:52,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:33:52 BoogieIcfgContainer [2025-03-16 19:33:52,470 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:33:52,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:33:52,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:33:52,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:33:52,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:33:50" (1/3) ... [2025-03-16 19:33:52,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d64a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:33:52, skipping insertion in model container [2025-03-16 19:33:52,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:51" (2/3) ... [2025-03-16 19:33:52,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d64a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:33:52, skipping insertion in model container [2025-03-16 19:33:52,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:33:52" (3/3) ... [2025-03-16 19:33:52,477 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-16 19:33:52,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:33:52,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c that has 1 procedures, 330 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:33:52,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:33:52,557 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;@487dc4ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:33:52,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:33:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 328 states have (on average 1.6646341463414633) internal successors, (546), 329 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:33:52,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:52,579 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-16 19:33:52,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:52,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1579953757, now seen corresponding path program 1 times [2025-03-16 19:33:52,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:52,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863125766] [2025-03-16 19:33:52,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:52,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:33:52,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:33:52,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863125766] [2025-03-16 19:33:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863125766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:53,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:53,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:33:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951974629] [2025-03-16 19:33:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:53,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:33:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:53,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:33:53,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:33:53,084 INFO L87 Difference]: Start difference. First operand has 330 states, 328 states have (on average 1.6646341463414633) internal successors, (546), 329 states have internal predecessors, (546), 0 states have call successors, (0), 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 4 states, 4 states have (on average 31.5) internal successors, (126), 4 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-16 19:33:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:53,207 INFO L93 Difference]: Finished difference Result 629 states and 1030 transitions. [2025-03-16 19:33:53,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:33:53,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 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-16 19:33:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:53,214 INFO L225 Difference]: With dead ends: 629 [2025-03-16 19:33:53,214 INFO L226 Difference]: Without dead ends: 327 [2025-03-16 19:33:53,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:33:53,218 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 93 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:53,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1480 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-16 19:33:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-03-16 19:33:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.539877300613497) internal successors, (502), 326 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 502 transitions. [2025-03-16 19:33:53,250 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 502 transitions. Word has length 126 [2025-03-16 19:33:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:53,250 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 502 transitions. [2025-03-16 19:33:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 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-16 19:33:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 502 transitions. [2025-03-16 19:33:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 19:33:53,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:53,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:53,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:33:53,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:53,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1809314165, now seen corresponding path program 1 times [2025-03-16 19:33:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:53,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846984965] [2025-03-16 19:33:53,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:53,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 19:33:53,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 19:33:53,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:53,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:53,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846984965] [2025-03-16 19:33:53,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846984965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:53,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:53,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:53,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012296032] [2025-03-16 19:33:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:53,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:53,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:53,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:53,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:53,463 INFO L87 Difference]: Start difference. First operand 327 states and 502 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:53,513 INFO L93 Difference]: Finished difference Result 811 states and 1274 transitions. [2025-03-16 19:33:53,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:53,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-16 19:33:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:53,517 INFO L225 Difference]: With dead ends: 811 [2025-03-16 19:33:53,517 INFO L226 Difference]: Without dead ends: 524 [2025-03-16 19:33:53,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:53,518 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 342 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:53,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 989 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-16 19:33:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 522. [2025-03-16 19:33:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.5547024952015356) internal successors, (810), 521 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 810 transitions. [2025-03-16 19:33:53,534 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 810 transitions. Word has length 156 [2025-03-16 19:33:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:53,534 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 810 transitions. [2025-03-16 19:33:53,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 810 transitions. [2025-03-16 19:33:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:33:53,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:53,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:53,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:33:53,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:53,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash -650823898, now seen corresponding path program 1 times [2025-03-16 19:33:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400020266] [2025-03-16 19:33:53,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:53,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:33:53,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:33:53,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:53,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400020266] [2025-03-16 19:33:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400020266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:53,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:53,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846984034] [2025-03-16 19:33:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:53,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:53,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:53,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:53,650 INFO L87 Difference]: Start difference. First operand 522 states and 810 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:53,691 INFO L93 Difference]: Finished difference Result 1350 states and 2127 transitions. [2025-03-16 19:33:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:53,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-03-16 19:33:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:53,694 INFO L225 Difference]: With dead ends: 1350 [2025-03-16 19:33:53,695 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 19:33:53,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:53,699 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 330 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:53,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 890 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 19:33:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2025-03-16 19:33:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.5614236509758899) internal successors, (1360), 871 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1360 transitions. [2025-03-16 19:33:53,738 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1360 transitions. Word has length 159 [2025-03-16 19:33:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:53,739 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1360 transitions. [2025-03-16 19:33:53,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1360 transitions. [2025-03-16 19:33:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 19:33:53,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:53,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:53,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:33:53,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:53,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash 504970713, now seen corresponding path program 1 times [2025-03-16 19:33:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:53,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272993786] [2025-03-16 19:33:53,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:53,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 19:33:53,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 19:33:53,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:53,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:53,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:53,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272993786] [2025-03-16 19:33:53,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272993786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:53,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:53,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:53,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478185943] [2025-03-16 19:33:53,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:53,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:53,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:53,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:53,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:53,839 INFO L87 Difference]: Start difference. First operand 872 states and 1360 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:53,888 INFO L93 Difference]: Finished difference Result 2310 states and 3635 transitions. [2025-03-16 19:33:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-16 19:33:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:53,895 INFO L225 Difference]: With dead ends: 2310 [2025-03-16 19:33:53,895 INFO L226 Difference]: Without dead ends: 1490 [2025-03-16 19:33:53,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:53,896 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 316 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:53,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 949 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-03-16 19:33:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1488. [2025-03-16 19:33:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1487 states have (on average 1.5601882985877606) internal successors, (2320), 1487 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2320 transitions. [2025-03-16 19:33:53,927 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2320 transitions. Word has length 162 [2025-03-16 19:33:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:53,928 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 2320 transitions. [2025-03-16 19:33:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2320 transitions. [2025-03-16 19:33:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 19:33:53,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:53,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:53,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:33:53,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:53,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1659704637, now seen corresponding path program 1 times [2025-03-16 19:33:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:53,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266107430] [2025-03-16 19:33:53,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:53,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 19:33:53,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 19:33:53,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:53,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:54,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:54,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266107430] [2025-03-16 19:33:54,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266107430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:54,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:54,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:54,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809381827] [2025-03-16 19:33:54,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:54,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:54,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:54,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:54,051 INFO L87 Difference]: Start difference. First operand 1488 states and 2320 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:54,101 INFO L93 Difference]: Finished difference Result 3980 states and 6231 transitions. [2025-03-16 19:33:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:54,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-16 19:33:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:54,110 INFO L225 Difference]: With dead ends: 3980 [2025-03-16 19:33:54,110 INFO L226 Difference]: Without dead ends: 2550 [2025-03-16 19:33:54,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:54,115 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 304 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:54,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 850 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2025-03-16 19:33:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2548. [2025-03-16 19:33:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2547 states have (on average 1.551629367883785) internal successors, (3952), 2547 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3952 transitions. [2025-03-16 19:33:54,174 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3952 transitions. Word has length 165 [2025-03-16 19:33:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:54,175 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 3952 transitions. [2025-03-16 19:33:54,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3952 transitions. [2025-03-16 19:33:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:33:54,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:54,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:54,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:33:54,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:54,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1176983730, now seen corresponding path program 1 times [2025-03-16 19:33:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127639755] [2025-03-16 19:33:54,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:54,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:33:54,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:33:54,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:54,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:54,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:54,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127639755] [2025-03-16 19:33:54,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127639755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:54,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:54,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450905825] [2025-03-16 19:33:54,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:54,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:54,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:54,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:54,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:54,297 INFO L87 Difference]: Start difference. First operand 2548 states and 3952 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:54,350 INFO L93 Difference]: Finished difference Result 6806 states and 10559 transitions. [2025-03-16 19:33:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:54,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-16 19:33:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:54,365 INFO L225 Difference]: With dead ends: 6806 [2025-03-16 19:33:54,365 INFO L226 Difference]: Without dead ends: 4322 [2025-03-16 19:33:54,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:54,370 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 290 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:54,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 924 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2025-03-16 19:33:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 4320. [2025-03-16 19:33:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4320 states, 4319 states have (on average 1.5355406344061124) internal successors, (6632), 4319 states have internal predecessors, (6632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 6632 transitions. [2025-03-16 19:33:54,475 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 6632 transitions. Word has length 168 [2025-03-16 19:33:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:54,475 INFO L471 AbstractCegarLoop]: Abstraction has 4320 states and 6632 transitions. [2025-03-16 19:33:54,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 6632 transitions. [2025-03-16 19:33:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 19:33:54,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:54,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:54,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:33:54,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:54,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1399796945, now seen corresponding path program 1 times [2025-03-16 19:33:54,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:54,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876607475] [2025-03-16 19:33:54,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:54,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 19:33:54,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 19:33:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:54,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:54,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:54,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876607475] [2025-03-16 19:33:54,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876607475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:54,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402006694] [2025-03-16 19:33:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:54,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:54,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:54,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:54,749 INFO L87 Difference]: Start difference. First operand 4320 states and 6632 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:55,472 INFO L93 Difference]: Finished difference Result 39589 states and 60563 transitions. [2025-03-16 19:33:55,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:33:55,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-16 19:33:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:55,555 INFO L225 Difference]: With dead ends: 39589 [2025-03-16 19:33:55,556 INFO L226 Difference]: Without dead ends: 35339 [2025-03-16 19:33:55,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:33:55,573 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 2703 mSDsluCounter, 6218 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 7982 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:55,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2703 Valid, 7982 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:33:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35339 states. [2025-03-16 19:33:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35339 to 8508. [2025-03-16 19:33:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8508 states, 8507 states have (on average 1.507111790290349) internal successors, (12821), 8507 states have internal predecessors, (12821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8508 states to 8508 states and 12821 transitions. [2025-03-16 19:33:56,113 INFO L78 Accepts]: Start accepts. Automaton has 8508 states and 12821 transitions. Word has length 171 [2025-03-16 19:33:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:56,116 INFO L471 AbstractCegarLoop]: Abstraction has 8508 states and 12821 transitions. [2025-03-16 19:33:56,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 8508 states and 12821 transitions. [2025-03-16 19:33:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:33:56,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:56,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:56,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:33:56,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:56,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2094840074, now seen corresponding path program 1 times [2025-03-16 19:33:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:56,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201556793] [2025-03-16 19:33:56,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:56,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:33:56,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:33:56,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:56,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201556793] [2025-03-16 19:33:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201556793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:56,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142057747] [2025-03-16 19:33:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:56,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:56,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:56,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:56,230 INFO L87 Difference]: Start difference. First operand 8508 states and 12821 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:56,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:56,317 INFO L93 Difference]: Finished difference Result 20366 states and 30671 transitions. [2025-03-16 19:33:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:56,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-03-16 19:33:56,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:56,335 INFO L225 Difference]: With dead ends: 20366 [2025-03-16 19:33:56,335 INFO L226 Difference]: Without dead ends: 11926 [2025-03-16 19:33:56,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:56,347 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 348 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:56,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1111 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11926 states. [2025-03-16 19:33:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11926 to 11924. [2025-03-16 19:33:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11924 states, 11923 states have (on average 1.487545080936006) internal successors, (17736), 11923 states have internal predecessors, (17736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11924 states to 11924 states and 17736 transitions. [2025-03-16 19:33:56,568 INFO L78 Accepts]: Start accepts. Automaton has 11924 states and 17736 transitions. Word has length 175 [2025-03-16 19:33:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:56,568 INFO L471 AbstractCegarLoop]: Abstraction has 11924 states and 17736 transitions. [2025-03-16 19:33:56,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 11924 states and 17736 transitions. [2025-03-16 19:33:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:33:56,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:56,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:56,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:33:56,587 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:56,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash -733055183, now seen corresponding path program 1 times [2025-03-16 19:33:56,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:56,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830038825] [2025-03-16 19:33:56,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:56,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:33:56,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:33:56,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:56,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:56,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-16 19:33:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:56,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830038825] [2025-03-16 19:33:56,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830038825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:56,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:56,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:56,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095605086] [2025-03-16 19:33:56,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:56,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:56,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:56,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:56,967 INFO L87 Difference]: Start difference. First operand 11924 states and 17736 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:57,288 INFO L93 Difference]: Finished difference Result 23781 states and 35393 transitions. [2025-03-16 19:33:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:57,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-03-16 19:33:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:57,305 INFO L225 Difference]: With dead ends: 23781 [2025-03-16 19:33:57,305 INFO L226 Difference]: Without dead ends: 11926 [2025-03-16 19:33:57,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:33:57,318 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 1819 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:57,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 2010 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11926 states. [2025-03-16 19:33:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11926 to 11924. [2025-03-16 19:33:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11924 states, 11923 states have (on average 1.4726998238698314) internal successors, (17559), 11923 states have internal predecessors, (17559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11924 states to 11924 states and 17559 transitions. [2025-03-16 19:33:57,498 INFO L78 Accepts]: Start accepts. Automaton has 11924 states and 17559 transitions. Word has length 175 [2025-03-16 19:33:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:57,498 INFO L471 AbstractCegarLoop]: Abstraction has 11924 states and 17559 transitions. [2025-03-16 19:33:57,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11924 states and 17559 transitions. [2025-03-16 19:33:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:33:57,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:57,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:57,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:33:57,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:57,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1100238669, now seen corresponding path program 1 times [2025-03-16 19:33:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:57,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755509914] [2025-03-16 19:33:57,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:57,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:33:57,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:33:57,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:57,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755509914] [2025-03-16 19:33:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755509914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:57,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:57,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066907708] [2025-03-16 19:33:57,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:57,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:57,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:57,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:57,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:57,752 INFO L87 Difference]: Start difference. First operand 11924 states and 17559 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:58,157 INFO L93 Difference]: Finished difference Result 58100 states and 85351 transitions. [2025-03-16 19:33:58,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:58,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-16 19:33:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:58,300 INFO L225 Difference]: With dead ends: 58100 [2025-03-16 19:33:58,300 INFO L226 Difference]: Without dead ends: 52466 [2025-03-16 19:33:58,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:33:58,309 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 2181 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 4338 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:58,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 4338 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:33:58,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52466 states. [2025-03-16 19:33:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52466 to 21186. [2025-03-16 19:33:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21186 states, 21185 states have (on average 1.4665565258437574) internal successors, (31069), 21185 states have internal predecessors, (31069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21186 states to 21186 states and 31069 transitions. [2025-03-16 19:33:58,789 INFO L78 Accepts]: Start accepts. Automaton has 21186 states and 31069 transitions. Word has length 176 [2025-03-16 19:33:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:58,789 INFO L471 AbstractCegarLoop]: Abstraction has 21186 states and 31069 transitions. [2025-03-16 19:33:58,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 21186 states and 31069 transitions. [2025-03-16 19:33:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:33:58,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:58,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:58,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:33:58,818 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:58,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash -476192443, now seen corresponding path program 1 times [2025-03-16 19:33:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:58,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78814055] [2025-03-16 19:33:58,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:58,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:33:58,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:33:58,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:58,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:59,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:59,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78814055] [2025-03-16 19:33:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78814055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:59,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:59,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:59,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150863265] [2025-03-16 19:33:59,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:59,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:59,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:59,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:59,085 INFO L87 Difference]: Start difference. First operand 21186 states and 31069 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:59,551 INFO L93 Difference]: Finished difference Result 67455 states and 99033 transitions. [2025-03-16 19:33:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-16 19:33:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:59,637 INFO L225 Difference]: With dead ends: 67455 [2025-03-16 19:33:59,637 INFO L226 Difference]: Without dead ends: 59445 [2025-03-16 19:33:59,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:33:59,662 INFO L435 NwaCegarLoop]: 1247 mSDtfsCounter, 2404 mSDsluCounter, 2800 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 4047 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:59,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 4047 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:33:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59445 states. [2025-03-16 19:34:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59445 to 34210. [2025-03-16 19:34:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34210 states, 34209 states have (on average 1.4600251395831507) internal successors, (49946), 34209 states have internal predecessors, (49946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34210 states to 34210 states and 49946 transitions. [2025-03-16 19:34:00,491 INFO L78 Accepts]: Start accepts. Automaton has 34210 states and 49946 transitions. Word has length 176 [2025-03-16 19:34:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:00,491 INFO L471 AbstractCegarLoop]: Abstraction has 34210 states and 49946 transitions. [2025-03-16 19:34:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 34210 states and 49946 transitions. [2025-03-16 19:34:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:34:00,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:00,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:00,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:34:00,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:00,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 960608333, now seen corresponding path program 1 times [2025-03-16 19:34:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:00,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356688824] [2025-03-16 19:34:00,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:00,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:34:00,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:34:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:00,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356688824] [2025-03-16 19:34:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356688824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:00,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:00,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206086778] [2025-03-16 19:34:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:00,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:34:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:00,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:34:00,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:00,717 INFO L87 Difference]: Start difference. First operand 34210 states and 49946 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:01,104 INFO L93 Difference]: Finished difference Result 76611 states and 112293 transitions. [2025-03-16 19:34:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:34:01,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-16 19:34:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:01,186 INFO L225 Difference]: With dead ends: 76611 [2025-03-16 19:34:01,187 INFO L226 Difference]: Without dead ends: 68889 [2025-03-16 19:34:01,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:34:01,215 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 2559 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:01,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 3394 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68889 states. [2025-03-16 19:34:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68889 to 43656. [2025-03-16 19:34:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43656 states, 43655 states have (on average 1.4576337189325392) internal successors, (63633), 43655 states have internal predecessors, (63633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43656 states to 43656 states and 63633 transitions. [2025-03-16 19:34:01,944 INFO L78 Accepts]: Start accepts. Automaton has 43656 states and 63633 transitions. Word has length 176 [2025-03-16 19:34:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:01,944 INFO L471 AbstractCegarLoop]: Abstraction has 43656 states and 63633 transitions. [2025-03-16 19:34:01,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 43656 states and 63633 transitions. [2025-03-16 19:34:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:34:01,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:01,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:01,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:34:01,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:01,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2098523401, now seen corresponding path program 1 times [2025-03-16 19:34:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511266914] [2025-03-16 19:34:01,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:02,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:34:02,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:34:02,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:02,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:02,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511266914] [2025-03-16 19:34:02,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511266914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:02,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:02,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305298275] [2025-03-16 19:34:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:02,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:34:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:02,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:34:02,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:02,185 INFO L87 Difference]: Start difference. First operand 43656 states and 63633 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:02,754 INFO L93 Difference]: Finished difference Result 85531 states and 125205 transitions. [2025-03-16 19:34:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:34:02,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-16 19:34:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:02,835 INFO L225 Difference]: With dead ends: 85531 [2025-03-16 19:34:02,835 INFO L226 Difference]: Without dead ends: 77665 [2025-03-16 19:34:02,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:34:02,856 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 2337 mSDsluCounter, 2709 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:02,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 3927 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77665 states. [2025-03-16 19:34:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77665 to 53309. [2025-03-16 19:34:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53309 states, 53308 states have (on average 1.4564605687701657) internal successors, (77641), 53308 states have internal predecessors, (77641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53309 states to 53309 states and 77641 transitions. [2025-03-16 19:34:03,689 INFO L78 Accepts]: Start accepts. Automaton has 53309 states and 77641 transitions. Word has length 176 [2025-03-16 19:34:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:03,690 INFO L471 AbstractCegarLoop]: Abstraction has 53309 states and 77641 transitions. [2025-03-16 19:34:03,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 53309 states and 77641 transitions. [2025-03-16 19:34:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:34:03,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:03,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:03,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:34:03,734 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:03,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:03,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1202705739, now seen corresponding path program 1 times [2025-03-16 19:34:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783453634] [2025-03-16 19:34:03,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:03,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:34:03,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:34:03,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:03,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783453634] [2025-03-16 19:34:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783453634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:03,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262569846] [2025-03-16 19:34:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:34:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:03,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:34:03,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:03,935 INFO L87 Difference]: Start difference. First operand 53309 states and 77641 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:04,601 INFO L93 Difference]: Finished difference Result 95669 states and 139941 transitions. [2025-03-16 19:34:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:34:04,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-16 19:34:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:04,674 INFO L225 Difference]: With dead ends: 95669 [2025-03-16 19:34:04,674 INFO L226 Difference]: Without dead ends: 87515 [2025-03-16 19:34:04,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:34:04,690 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 2401 mSDsluCounter, 3321 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 4714 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:04,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 4714 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87515 states. [2025-03-16 19:34:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87515 to 63274. [2025-03-16 19:34:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63274 states, 63273 states have (on average 1.4559606783304095) internal successors, (92123), 63273 states have internal predecessors, (92123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63274 states to 63274 states and 92123 transitions. [2025-03-16 19:34:05,506 INFO L78 Accepts]: Start accepts. Automaton has 63274 states and 92123 transitions. Word has length 176 [2025-03-16 19:34:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:05,506 INFO L471 AbstractCegarLoop]: Abstraction has 63274 states and 92123 transitions. [2025-03-16 19:34:05,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 63274 states and 92123 transitions. [2025-03-16 19:34:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 19:34:05,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:05,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:05,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:34:05,556 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:05,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:05,556 INFO L85 PathProgramCache]: Analyzing trace with hash 439256457, now seen corresponding path program 1 times [2025-03-16 19:34:05,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:05,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022463873] [2025-03-16 19:34:05,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:05,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:05,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 19:34:05,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 19:34:05,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:05,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:05,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022463873] [2025-03-16 19:34:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022463873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:05,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:05,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016398869] [2025-03-16 19:34:05,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:05,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:05,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:05,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:05,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:05,619 INFO L87 Difference]: Start difference. First operand 63274 states and 92123 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:06,363 INFO L93 Difference]: Finished difference Result 186640 states and 271162 transitions. [2025-03-16 19:34:06,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:06,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 19:34:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:06,493 INFO L225 Difference]: With dead ends: 186640 [2025-03-16 19:34:06,493 INFO L226 Difference]: Without dead ends: 125497 [2025-03-16 19:34:06,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:06,548 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 349 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:06,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 537 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125497 states. [2025-03-16 19:34:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125497 to 125495. [2025-03-16 19:34:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125495 states, 125494 states have (on average 1.4436228026837936) internal successors, (181166), 125494 states have internal predecessors, (181166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125495 states to 125495 states and 181166 transitions. [2025-03-16 19:34:08,061 INFO L78 Accepts]: Start accepts. Automaton has 125495 states and 181166 transitions. Word has length 178 [2025-03-16 19:34:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 125495 states and 181166 transitions. [2025-03-16 19:34:08,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 125495 states and 181166 transitions. [2025-03-16 19:34:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 19:34:08,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:08,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:08,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:34:08,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:08,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash 770267944, now seen corresponding path program 1 times [2025-03-16 19:34:08,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:08,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478104312] [2025-03-16 19:34:08,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:08,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 19:34:08,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 19:34:08,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:08,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478104312] [2025-03-16 19:34:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478104312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:08,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397049264] [2025-03-16 19:34:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:08,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:08,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:08,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:08,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:08,607 INFO L87 Difference]: Start difference. First operand 125495 states and 181166 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:08,981 INFO L93 Difference]: Finished difference Result 201403 states and 291814 transitions. [2025-03-16 19:34:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:08,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 19:34:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:09,318 INFO L225 Difference]: With dead ends: 201403 [2025-03-16 19:34:09,318 INFO L226 Difference]: Without dead ends: 87185 [2025-03-16 19:34:09,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:09,363 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 199 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:09,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 725 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87185 states. [2025-03-16 19:34:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87185 to 87183. [2025-03-16 19:34:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87183 states, 87182 states have (on average 1.4372462205501135) internal successors, (125302), 87182 states have internal predecessors, (125302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87183 states to 87183 states and 125302 transitions. [2025-03-16 19:34:10,698 INFO L78 Accepts]: Start accepts. Automaton has 87183 states and 125302 transitions. Word has length 178 [2025-03-16 19:34:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:10,698 INFO L471 AbstractCegarLoop]: Abstraction has 87183 states and 125302 transitions. [2025-03-16 19:34:10,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 87183 states and 125302 transitions. [2025-03-16 19:34:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 19:34:10,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:10,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:34:10,755 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:10,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 791559047, now seen corresponding path program 1 times [2025-03-16 19:34:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002013550] [2025-03-16 19:34:10,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:10,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 19:34:10,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 19:34:10,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:10,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:10,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:10,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002013550] [2025-03-16 19:34:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002013550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93696534] [2025-03-16 19:34:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:10,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:10,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:10,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:10,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:10,857 INFO L87 Difference]: Start difference. First operand 87183 states and 125302 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:11,272 INFO L93 Difference]: Finished difference Result 123247 states and 177550 transitions. [2025-03-16 19:34:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:11,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 19:34:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:11,312 INFO L225 Difference]: With dead ends: 123247 [2025-03-16 19:34:11,312 INFO L226 Difference]: Without dead ends: 44663 [2025-03-16 19:34:11,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:11,346 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 194 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:11,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 688 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:11,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44663 states. [2025-03-16 19:34:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44663 to 44661. [2025-03-16 19:34:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44661 states, 44660 states have (on average 1.4249888042991492) internal successors, (63640), 44660 states have internal predecessors, (63640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44661 states to 44661 states and 63640 transitions. [2025-03-16 19:34:12,044 INFO L78 Accepts]: Start accepts. Automaton has 44661 states and 63640 transitions. Word has length 178 [2025-03-16 19:34:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:12,044 INFO L471 AbstractCegarLoop]: Abstraction has 44661 states and 63640 transitions. [2025-03-16 19:34:12,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 44661 states and 63640 transitions. [2025-03-16 19:34:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 19:34:12,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:12,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:12,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:34:12,079 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:12,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash 184779184, now seen corresponding path program 1 times [2025-03-16 19:34:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:12,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252993110] [2025-03-16 19:34:12,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:12,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 19:34:12,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 19:34:12,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:12,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252993110] [2025-03-16 19:34:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252993110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694896777] [2025-03-16 19:34:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:12,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:12,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:12,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:12,214 INFO L87 Difference]: Start difference. First operand 44661 states and 63640 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:12,355 INFO L93 Difference]: Finished difference Result 56189 states and 80526 transitions. [2025-03-16 19:34:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:12,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 19:34:12,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:12,373 INFO L225 Difference]: With dead ends: 56189 [2025-03-16 19:34:12,373 INFO L226 Difference]: Without dead ends: 16576 [2025-03-16 19:34:12,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:12,395 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 163 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:12,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 631 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2025-03-16 19:34:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 16574. [2025-03-16 19:34:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16574 states, 16573 states have (on average 1.4331141012490194) internal successors, (23751), 16573 states have internal predecessors, (23751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16574 states to 16574 states and 23751 transitions. [2025-03-16 19:34:12,738 INFO L78 Accepts]: Start accepts. Automaton has 16574 states and 23751 transitions. Word has length 178 [2025-03-16 19:34:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:12,739 INFO L471 AbstractCegarLoop]: Abstraction has 16574 states and 23751 transitions. [2025-03-16 19:34:12,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16574 states and 23751 transitions. [2025-03-16 19:34:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 19:34:12,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:12,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:12,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:34:12,747 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:12,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash -740749785, now seen corresponding path program 1 times [2025-03-16 19:34:12,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:12,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935481059] [2025-03-16 19:34:12,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:12,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 19:34:12,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 19:34:12,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:12,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935481059] [2025-03-16 19:34:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935481059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479325649] [2025-03-16 19:34:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:12,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:12,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:12,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:12,836 INFO L87 Difference]: Start difference. First operand 16574 states and 23751 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:12,885 INFO L93 Difference]: Finished difference Result 23366 states and 33595 transitions. [2025-03-16 19:34:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:12,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 19:34:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:12,893 INFO L225 Difference]: With dead ends: 23366 [2025-03-16 19:34:12,893 INFO L226 Difference]: Without dead ends: 8512 [2025-03-16 19:34:12,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:12,901 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 155 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:12,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 584 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8512 states. [2025-03-16 19:34:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8512 to 8510. [2025-03-16 19:34:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8510 states, 8509 states have (on average 1.4190856739922435) internal successors, (12075), 8509 states have internal predecessors, (12075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8510 states to 8510 states and 12075 transitions. [2025-03-16 19:34:12,982 INFO L78 Accepts]: Start accepts. Automaton has 8510 states and 12075 transitions. Word has length 178 [2025-03-16 19:34:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:12,983 INFO L471 AbstractCegarLoop]: Abstraction has 8510 states and 12075 transitions. [2025-03-16 19:34:12,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8510 states and 12075 transitions. [2025-03-16 19:34:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 19:34:12,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:12,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:12,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:34:12,989 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:12,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -747222186, now seen corresponding path program 1 times [2025-03-16 19:34:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062571417] [2025-03-16 19:34:12,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:13,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 19:34:13,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 19:34:13,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:13,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:13,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062571417] [2025-03-16 19:34:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062571417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:13,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:13,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555671815] [2025-03-16 19:34:13,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:13,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:34:13,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:13,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:34:13,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:34:13,309 INFO L87 Difference]: Start difference. First operand 8510 states and 12075 transitions. Second operand has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 8 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:13,976 INFO L93 Difference]: Finished difference Result 27460 states and 38945 transitions. [2025-03-16 19:34:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 8 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 19:34:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:13,992 INFO L225 Difference]: With dead ends: 27460 [2025-03-16 19:34:13,992 INFO L226 Difference]: Without dead ends: 19024 [2025-03-16 19:34:13,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:34:13,999 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1540 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:14,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 1285 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19024 states. [2025-03-16 19:34:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19024 to 17480. [2025-03-16 19:34:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17480 states, 17479 states have (on average 1.4132959551461755) internal successors, (24703), 17479 states have internal predecessors, (24703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17480 states to 17480 states and 24703 transitions. [2025-03-16 19:34:14,154 INFO L78 Accepts]: Start accepts. Automaton has 17480 states and 24703 transitions. Word has length 178 [2025-03-16 19:34:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:14,155 INFO L471 AbstractCegarLoop]: Abstraction has 17480 states and 24703 transitions. [2025-03-16 19:34:14,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 8 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 17480 states and 24703 transitions. [2025-03-16 19:34:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 19:34:14,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:14,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:14,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:34:14,164 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:14,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash 740498285, now seen corresponding path program 1 times [2025-03-16 19:34:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396847035] [2025-03-16 19:34:14,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:14,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 19:34:14,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 19:34:14,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:14,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:14,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:14,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396847035] [2025-03-16 19:34:14,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396847035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:14,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:14,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500627252] [2025-03-16 19:34:14,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:14,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:14,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:14,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:14,249 INFO L87 Difference]: Start difference. First operand 17480 states and 24703 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:14,301 INFO L93 Difference]: Finished difference Result 24572 states and 34909 transitions. [2025-03-16 19:34:14,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:14,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 19:34:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:14,308 INFO L225 Difference]: With dead ends: 24572 [2025-03-16 19:34:14,309 INFO L226 Difference]: Without dead ends: 9614 [2025-03-16 19:34:14,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:14,317 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 147 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:14,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 535 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9614 states. [2025-03-16 19:34:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9614 to 9612. [2025-03-16 19:34:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9612 states, 9611 states have (on average 1.3947560087399855) internal successors, (13405), 9611 states have internal predecessors, (13405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9612 states to 9612 states and 13405 transitions. [2025-03-16 19:34:14,411 INFO L78 Accepts]: Start accepts. Automaton has 9612 states and 13405 transitions. Word has length 178 [2025-03-16 19:34:14,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:14,411 INFO L471 AbstractCegarLoop]: Abstraction has 9612 states and 13405 transitions. [2025-03-16 19:34:14,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 9612 states and 13405 transitions. [2025-03-16 19:34:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 19:34:14,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:14,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:34:14,419 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:14,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1436570419, now seen corresponding path program 1 times [2025-03-16 19:34:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001479188] [2025-03-16 19:34:14,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:14,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 19:34:14,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 19:34:14,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:14,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:14,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:14,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001479188] [2025-03-16 19:34:14,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001479188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:14,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:14,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:14,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533982514] [2025-03-16 19:34:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:14,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:34:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:14,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:34:14,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:34:14,703 INFO L87 Difference]: Start difference. First operand 9612 states and 13405 transitions. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:15,330 INFO L93 Difference]: Finished difference Result 24142 states and 33627 transitions. [2025-03-16 19:34:15,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2025-03-16 19:34:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:15,344 INFO L225 Difference]: With dead ends: 24142 [2025-03-16 19:34:15,344 INFO L226 Difference]: Without dead ends: 14971 [2025-03-16 19:34:15,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:34:15,356 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1309 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:15,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 1443 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14971 states. [2025-03-16 19:34:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14971 to 10792. [2025-03-16 19:34:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10792 states, 10791 states have (on average 1.3825410063942174) internal successors, (14919), 10791 states have internal predecessors, (14919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10792 states to 10792 states and 14919 transitions. [2025-03-16 19:34:15,473 INFO L78 Accepts]: Start accepts. Automaton has 10792 states and 14919 transitions. Word has length 179 [2025-03-16 19:34:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:15,473 INFO L471 AbstractCegarLoop]: Abstraction has 10792 states and 14919 transitions. [2025-03-16 19:34:15,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:15,473 INFO L276 IsEmpty]: Start isEmpty. Operand 10792 states and 14919 transitions. [2025-03-16 19:34:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 19:34:15,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:15,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:15,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:34:15,480 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:15,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash 446747904, now seen corresponding path program 1 times [2025-03-16 19:34:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:15,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753137150] [2025-03-16 19:34:15,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:15,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 19:34:15,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 19:34:15,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:15,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:15,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:15,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753137150] [2025-03-16 19:34:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753137150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379895520] [2025-03-16 19:34:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:15,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:34:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:15,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:34:15,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:34:15,550 INFO L87 Difference]: Start difference. First operand 10792 states and 14919 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:15,708 INFO L93 Difference]: Finished difference Result 15902 states and 22119 transitions. [2025-03-16 19:34:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:34:15,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2025-03-16 19:34:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:15,717 INFO L225 Difference]: With dead ends: 15902 [2025-03-16 19:34:15,717 INFO L226 Difference]: Without dead ends: 9794 [2025-03-16 19:34:15,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:15,722 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 275 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:15,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 536 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9794 states. [2025-03-16 19:34:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9794 to 9792. [2025-03-16 19:34:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9792 states, 9791 states have (on average 1.3831069349402512) internal successors, (13542), 9791 states have internal predecessors, (13542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9792 states to 9792 states and 13542 transitions. [2025-03-16 19:34:15,817 INFO L78 Accepts]: Start accepts. Automaton has 9792 states and 13542 transitions. Word has length 180 [2025-03-16 19:34:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:15,817 INFO L471 AbstractCegarLoop]: Abstraction has 9792 states and 13542 transitions. [2025-03-16 19:34:15,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 9792 states and 13542 transitions. [2025-03-16 19:34:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 19:34:15,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:15,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:15,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:34:15,824 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash 721207007, now seen corresponding path program 1 times [2025-03-16 19:34:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032290871] [2025-03-16 19:34:15,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:15,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 19:34:15,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 19:34:15,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:15,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032290871] [2025-03-16 19:34:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032290871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:16,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:16,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:34:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814997058] [2025-03-16 19:34:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:16,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:34:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:16,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:34:16,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:16,493 INFO L87 Difference]: Start difference. First operand 9792 states and 13542 transitions. Second operand has 13 states, 13 states have (on average 13.846153846153847) internal successors, (180), 12 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:17,633 INFO L93 Difference]: Finished difference Result 16721 states and 23223 transitions. [2025-03-16 19:34:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:17,634 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.846153846153847) internal successors, (180), 12 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2025-03-16 19:34:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:17,646 INFO L225 Difference]: With dead ends: 16721 [2025-03-16 19:34:17,646 INFO L226 Difference]: Without dead ends: 13390 [2025-03-16 19:34:17,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:34:17,652 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 1284 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:17,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1988 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:34:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13390 states. [2025-03-16 19:34:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13390 to 8192. [2025-03-16 19:34:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8192 states, 8191 states have (on average 1.3842021731168355) internal successors, (11338), 8191 states have internal predecessors, (11338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 11338 transitions. [2025-03-16 19:34:17,762 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 11338 transitions. Word has length 180 [2025-03-16 19:34:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:17,763 INFO L471 AbstractCegarLoop]: Abstraction has 8192 states and 11338 transitions. [2025-03-16 19:34:17,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.846153846153847) internal successors, (180), 12 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 11338 transitions. [2025-03-16 19:34:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 19:34:17,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:17,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:17,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:34:17,768 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:17,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash -541978426, now seen corresponding path program 1 times [2025-03-16 19:34:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345619640] [2025-03-16 19:34:17,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:17,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 19:34:17,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 19:34:17,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:17,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:18,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:18,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345619640] [2025-03-16 19:34:18,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345619640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:18,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:18,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:18,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707327484] [2025-03-16 19:34:18,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:18,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:34:18,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:18,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:34:18,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:34:18,051 INFO L87 Difference]: Start difference. First operand 8192 states and 11338 transitions. Second operand has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:18,589 INFO L93 Difference]: Finished difference Result 24327 states and 33609 transitions. [2025-03-16 19:34:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:18,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2025-03-16 19:34:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:18,603 INFO L225 Difference]: With dead ends: 24327 [2025-03-16 19:34:18,603 INFO L226 Difference]: Without dead ends: 16185 [2025-03-16 19:34:18,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:34:18,610 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1048 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:18,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1031 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16185 states. [2025-03-16 19:34:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16185 to 15957. [2025-03-16 19:34:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15957 states, 15956 states have (on average 1.3791050388568564) internal successors, (22005), 15956 states have internal predecessors, (22005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15957 states to 15957 states and 22005 transitions. [2025-03-16 19:34:18,761 INFO L78 Accepts]: Start accepts. Automaton has 15957 states and 22005 transitions. Word has length 180 [2025-03-16 19:34:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:18,761 INFO L471 AbstractCegarLoop]: Abstraction has 15957 states and 22005 transitions. [2025-03-16 19:34:18,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 15957 states and 22005 transitions. [2025-03-16 19:34:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 19:34:18,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:18,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:34:18,770 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:18,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1030726758, now seen corresponding path program 1 times [2025-03-16 19:34:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:18,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468611034] [2025-03-16 19:34:18,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:18,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:18,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 19:34:18,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 19:34:18,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:18,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:19,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:19,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468611034] [2025-03-16 19:34:19,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468611034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:19,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:19,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:19,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419471579] [2025-03-16 19:34:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:19,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:34:19,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:19,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:34:19,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:34:19,035 INFO L87 Difference]: Start difference. First operand 15957 states and 22005 transitions. Second operand has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:19,576 INFO L93 Difference]: Finished difference Result 51469 states and 70651 transitions. [2025-03-16 19:34:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2025-03-16 19:34:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:19,608 INFO L225 Difference]: With dead ends: 51469 [2025-03-16 19:34:19,608 INFO L226 Difference]: Without dead ends: 35556 [2025-03-16 19:34:19,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:34:19,625 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 1294 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:19,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1417 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35556 states. [2025-03-16 19:34:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35556 to 35161. [2025-03-16 19:34:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35161 states, 35160 states have (on average 1.3638794084186576) internal successors, (47954), 35160 states have internal predecessors, (47954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35161 states to 35161 states and 47954 transitions. [2025-03-16 19:34:20,036 INFO L78 Accepts]: Start accepts. Automaton has 35161 states and 47954 transitions. Word has length 180 [2025-03-16 19:34:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:20,037 INFO L471 AbstractCegarLoop]: Abstraction has 35161 states and 47954 transitions. [2025-03-16 19:34:20,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 35161 states and 47954 transitions. [2025-03-16 19:34:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 19:34:20,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:20,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:34:20,065 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:20,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1795747769, now seen corresponding path program 1 times [2025-03-16 19:34:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17372206] [2025-03-16 19:34:20,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:20,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 19:34:20,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 19:34:20,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:20,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:20,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17372206] [2025-03-16 19:34:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17372206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:20,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:20,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:34:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187806433] [2025-03-16 19:34:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:20,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:34:20,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:20,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:34:20,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:34:20,672 INFO L87 Difference]: Start difference. First operand 35161 states and 47954 transitions. Second operand has 14 states, 14 states have (on average 12.928571428571429) internal successors, (181), 13 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:22,502 INFO L93 Difference]: Finished difference Result 139704 states and 190522 transitions. [2025-03-16 19:34:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 19:34:22,502 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.928571428571429) internal successors, (181), 13 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-03-16 19:34:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:22,633 INFO L225 Difference]: With dead ends: 139704 [2025-03-16 19:34:22,633 INFO L226 Difference]: Without dead ends: 104616 [2025-03-16 19:34:22,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 19:34:22,683 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 2187 mSDsluCounter, 3558 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 3957 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:22,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 3957 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:34:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104616 states. [2025-03-16 19:34:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104616 to 66796. [2025-03-16 19:34:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66796 states, 66795 states have (on average 1.357511789804626) internal successors, (90675), 66795 states have internal predecessors, (90675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66796 states to 66796 states and 90675 transitions. [2025-03-16 19:34:23,966 INFO L78 Accepts]: Start accepts. Automaton has 66796 states and 90675 transitions. Word has length 181 [2025-03-16 19:34:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:23,966 INFO L471 AbstractCegarLoop]: Abstraction has 66796 states and 90675 transitions. [2025-03-16 19:34:23,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.928571428571429) internal successors, (181), 13 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 66796 states and 90675 transitions. [2025-03-16 19:34:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 19:34:24,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:24,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:24,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:34:24,015 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:24,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:24,015 INFO L85 PathProgramCache]: Analyzing trace with hash 291718716, now seen corresponding path program 1 times [2025-03-16 19:34:24,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:24,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711830537] [2025-03-16 19:34:24,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:24,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 19:34:24,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 19:34:24,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:24,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711830537] [2025-03-16 19:34:24,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711830537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:24,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:24,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374374904] [2025-03-16 19:34:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:24,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:34:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:24,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:34:24,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:34:24,309 INFO L87 Difference]: Start difference. First operand 66796 states and 90675 transitions. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:25,073 INFO L93 Difference]: Finished difference Result 158194 states and 214538 transitions. [2025-03-16 19:34:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:25,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-03-16 19:34:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:25,181 INFO L225 Difference]: With dead ends: 158194 [2025-03-16 19:34:25,181 INFO L226 Difference]: Without dead ends: 108957 [2025-03-16 19:34:25,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:34:25,234 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 958 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:25,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1202 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108957 states. [2025-03-16 19:34:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108957 to 67382. [2025-03-16 19:34:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67382 states, 67381 states have (on average 1.3566880871462281) internal successors, (91415), 67381 states have internal predecessors, (91415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67382 states to 67382 states and 91415 transitions. [2025-03-16 19:34:26,323 INFO L78 Accepts]: Start accepts. Automaton has 67382 states and 91415 transitions. Word has length 181 [2025-03-16 19:34:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:26,323 INFO L471 AbstractCegarLoop]: Abstraction has 67382 states and 91415 transitions. [2025-03-16 19:34:26,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 67382 states and 91415 transitions. [2025-03-16 19:34:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 19:34:26,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:26,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:26,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:34:26,373 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:26,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash -665192080, now seen corresponding path program 1 times [2025-03-16 19:34:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820431774] [2025-03-16 19:34:26,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:26,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 19:34:26,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 19:34:26,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:26,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:27,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:27,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820431774] [2025-03-16 19:34:27,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820431774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:27,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:27,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:34:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300185307] [2025-03-16 19:34:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:34:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:27,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:34:27,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:27,110 INFO L87 Difference]: Start difference. First operand 67382 states and 91415 transitions. Second operand has 18 states, 18 states have (on average 10.11111111111111) internal successors, (182), 17 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:29,136 INFO L93 Difference]: Finished difference Result 128940 states and 174824 transitions. [2025-03-16 19:34:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-16 19:34:29,137 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.11111111111111) internal successors, (182), 17 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-16 19:34:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:29,253 INFO L225 Difference]: With dead ends: 128940 [2025-03-16 19:34:29,253 INFO L226 Difference]: Without dead ends: 106858 [2025-03-16 19:34:29,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=565, Invalid=1885, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 19:34:29,297 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 4049 mSDsluCounter, 2463 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4049 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:29,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4049 Valid, 2682 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:34:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106858 states.