./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.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 448913247e8c38d6975c8299b43203acc4129a19332f08af90d09f73955e1f22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:15:32,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:15:32,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:15:32,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:15:32,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:15:32,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:15:32,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:15:32,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:15:32,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:15:32,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:15:32,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:15:32,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:15:32,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:15:32,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:15:32,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:15:32,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:15:32,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:15:32,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:15:32,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:15:32,166 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 -> 448913247e8c38d6975c8299b43203acc4129a19332f08af90d09f73955e1f22 [2025-03-03 15:15:32,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:15:32,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:15:32,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:15:32,414 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:15:32,415 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:15:32,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2025-03-03 15:15:33,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02237cb7/21d50197d8e04702b638657742fccf59/FLAG900d2cd30 [2025-03-03 15:15:33,881 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:15:33,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2025-03-03 15:15:33,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02237cb7/21d50197d8e04702b638657742fccf59/FLAG900d2cd30 [2025-03-03 15:15:34,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02237cb7/21d50197d8e04702b638657742fccf59 [2025-03-03 15:15:34,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:15:34,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:15:34,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:15:34,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:15:34,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:15:34,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2dec28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34, skipping insertion in model container [2025-03-03 15:15:34,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:15:34,455 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.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[16438,16451] [2025-03-03 15:15:34,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:15:34,518 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:15:34,576 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.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[16438,16451] [2025-03-03 15:15:34,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:15:34,625 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:15:34,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34 WrapperNode [2025-03-03 15:15:34,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:15:34,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:15:34,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:15:34,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:15:34,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,715 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1514 [2025-03-03 15:15:34,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:15:34,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:15:34,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:15:34,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:15:34,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,754 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:15:34,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:15:34,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:15:34,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:15:34,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:15:34,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (1/1) ... [2025-03-03 15:15:34,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:15:34,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:15:34,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:15:34,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:15:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:15:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:15:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:15:34,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:15:34,955 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:15:34,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1523: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L335: havoc main_~node6__m6~0#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: havoc main_~node6____CPAchecker_TMP_0~3#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1789: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~node6__m6~1#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: havoc main_~node6__m6~2#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: havoc main_~node6__m6~3#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node4__m4~0#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1164: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L438: havoc main_~node4__m4~1#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1297: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node4__m4~2#1; [2025-03-03 15:15:35,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L704: havoc main_~node4__m4~3#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: havoc main_~node2__m2~0#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2323: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L870: havoc main_~node6__m6~4#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node2__m2~1#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1432: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node2__m2~2#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc main_~node2__m2~3#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L840: havoc main_~node4__m4~4#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1699: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2459: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1074: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966: havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L810: havoc main_~node2__m2~4#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1835: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2233: havoc main_~node6____CPAchecker_TMP_0~4#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2101: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1342: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2368: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: havoc main_~node5__m5~0#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1609: havoc main_~node6____CPAchecker_TMP_0~2#1; [2025-03-03 15:15:35,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L453: havoc main_~node5__m5~1#1; [2025-03-03 15:15:35,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1477: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:35,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: havoc main_~node5__m5~2#1; [2025-03-03 15:15:35,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: havoc main_~node5__m5~3#1; [2025-03-03 15:15:35,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: havoc main_~node3__m3~0#1; [2025-03-03 15:15:35,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-03 15:15:35,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1744: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:15:35,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L423: havoc main_~node3__m3~1#1; [2025-03-03 15:15:35,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L556: havoc main_~node3__m3~2#1; [2025-03-03 15:15:35,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:15:35,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: havoc main_~node3__m3~3#1; [2025-03-03 15:15:35,943 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L392: 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-03 15:15:35,943 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1119: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:15:35,943 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2011: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:15:35,943 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L855: havoc main_~node5__m5~4#1; [2025-03-03 15:15:35,943 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:15:35,943 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: 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-03 15:15:35,943 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: 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-03 15:15:35,943 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278: havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-03 15:15:35,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L825: havoc main_~node3__m3~4#1; [2025-03-03 15:15:35,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1387: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:35,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2147: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-03 15:15:35,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L794: 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-03 15:15:35,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2413: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-03 15:15:36,031 INFO L? ?]: Removed 221 outVars from TransFormulas that were not future-live. [2025-03-03 15:15:36,032 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:15:36,043 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:15:36,043 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:15:36,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:15:36 BoogieIcfgContainer [2025-03-03 15:15:36,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:15:36,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:15:36,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:15:36,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:15:36,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:15:34" (1/3) ... [2025-03-03 15:15:36,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13213dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:15:36, skipping insertion in model container [2025-03-03 15:15:36,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:34" (2/3) ... [2025-03-03 15:15:36,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13213dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:15:36, skipping insertion in model container [2025-03-03 15:15:36,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:15:36" (3/3) ... [2025-03-03 15:15:36,052 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2025-03-03 15:15:36,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:15:36,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c that has 1 procedures, 390 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:15:36,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:15:36,133 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;@610c7ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:15:36,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:15:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 388 states have (on average 1.6623711340206186) internal successors, (645), 389 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:15:36,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:36,147 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] [2025-03-03 15:15:36,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:36,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash 656158250, now seen corresponding path program 1 times [2025-03-03 15:15:36,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483855231] [2025-03-03 15:15:36,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:36,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:15:36,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:15:36,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:36,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483855231] [2025-03-03 15:15:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483855231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:36,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:36,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324411192] [2025-03-03 15:15:36,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:36,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:15:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:36,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:15:36,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:15:36,709 INFO L87 Difference]: Start difference. First operand has 390 states, 388 states have (on average 1.6623711340206186) internal successors, (645), 389 states have internal predecessors, (645), 0 states have call successors, (0), 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 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:36,846 INFO L93 Difference]: Finished difference Result 739 states and 1209 transitions. [2025-03-03 15:15:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:15:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-03-03 15:15:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:36,857 INFO L225 Difference]: With dead ends: 739 [2025-03-03 15:15:36,858 INFO L226 Difference]: Without dead ends: 387 [2025-03-03 15:15:36,863 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-03 15:15:36,864 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 109 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:36,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1752 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-03 15:15:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-03-03 15:15:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.5336787564766838) internal successors, (592), 386 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2025-03-03 15:15:36,898 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 147 [2025-03-03 15:15:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:36,898 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2025-03-03 15:15:36,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2025-03-03 15:15:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 15:15:36,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:36,901 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, 1, 1, 1, 1] [2025-03-03 15:15:36,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:15:36,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:36,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:36,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1953434287, now seen corresponding path program 1 times [2025-03-03 15:15:36,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:36,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666320633] [2025-03-03 15:15:36,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:36,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 15:15:36,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 15:15:36,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:36,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:37,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666320633] [2025-03-03 15:15:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666320633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:37,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:37,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784098671] [2025-03-03 15:15:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:37,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:37,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:37,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:37,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:37,073 INFO L87 Difference]: Start difference. First operand 387 states and 592 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:37,132 INFO L93 Difference]: Finished difference Result 961 states and 1508 transitions. [2025-03-03 15:15:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:37,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2025-03-03 15:15:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:37,136 INFO L225 Difference]: With dead ends: 961 [2025-03-03 15:15:37,138 INFO L226 Difference]: Without dead ends: 624 [2025-03-03 15:15:37,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:37,140 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 406 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:37,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1175 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-03 15:15:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2025-03-03 15:15:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.5523349436392915) internal successors, (964), 621 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 964 transitions. [2025-03-03 15:15:37,160 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 964 transitions. Word has length 186 [2025-03-03 15:15:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:37,161 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 964 transitions. [2025-03-03 15:15:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 964 transitions. [2025-03-03 15:15:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:15:37,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:37,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:15:37,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:37,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash 875310568, now seen corresponding path program 1 times [2025-03-03 15:15:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:37,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375127576] [2025-03-03 15:15:37,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:37,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:37,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:15:37,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:15:37,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:37,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:37,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:37,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375127576] [2025-03-03 15:15:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375127576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205140771] [2025-03-03 15:15:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:37,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:37,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:37,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:37,308 INFO L87 Difference]: Start difference. First operand 622 states and 964 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:37,356 INFO L93 Difference]: Finished difference Result 1620 states and 2553 transitions. [2025-03-03 15:15:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:37,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2025-03-03 15:15:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:37,360 INFO L225 Difference]: With dead ends: 1620 [2025-03-03 15:15:37,360 INFO L226 Difference]: Without dead ends: 1054 [2025-03-03 15:15:37,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:37,362 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 394 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:37,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1060 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-03-03 15:15:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1052. [2025-03-03 15:15:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.5623215984776404) internal successors, (1642), 1051 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1642 transitions. [2025-03-03 15:15:37,389 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1642 transitions. Word has length 189 [2025-03-03 15:15:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:37,390 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1642 transitions. [2025-03-03 15:15:37,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1642 transitions. [2025-03-03 15:15:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 15:15:37,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:37,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:15:37,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -645882903, now seen corresponding path program 1 times [2025-03-03 15:15:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082798620] [2025-03-03 15:15:37,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:37,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 15:15:37,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 15:15:37,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:37,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082798620] [2025-03-03 15:15:37,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082798620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:37,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:37,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823815873] [2025-03-03 15:15:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:37,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:37,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:37,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:37,527 INFO L87 Difference]: Start difference. First operand 1052 states and 1642 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:37,601 INFO L93 Difference]: Finished difference Result 2820 states and 4445 transitions. [2025-03-03 15:15:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:37,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2025-03-03 15:15:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:37,609 INFO L225 Difference]: With dead ends: 2820 [2025-03-03 15:15:37,609 INFO L226 Difference]: Without dead ends: 1830 [2025-03-03 15:15:37,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:37,612 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 380 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:37,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1198 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2025-03-03 15:15:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1828. [2025-03-03 15:15:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 1.5643130815544608) internal successors, (2858), 1827 states have internal predecessors, (2858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2858 transitions. [2025-03-03 15:15:37,661 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2858 transitions. Word has length 192 [2025-03-03 15:15:37,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:37,661 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2858 transitions. [2025-03-03 15:15:37,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2858 transitions. [2025-03-03 15:15:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 15:15:37,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:37,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:37,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:15:37,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:37,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash -226372490, now seen corresponding path program 1 times [2025-03-03 15:15:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:37,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261226548] [2025-03-03 15:15:37,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 15:15:37,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 15:15:37,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:37,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261226548] [2025-03-03 15:15:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261226548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:37,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:37,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008677657] [2025-03-03 15:15:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:37,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:37,801 INFO L87 Difference]: Start difference. First operand 1828 states and 2858 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:37,860 INFO L93 Difference]: Finished difference Result 4970 states and 7809 transitions. [2025-03-03 15:15:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:37,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2025-03-03 15:15:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:37,872 INFO L225 Difference]: With dead ends: 4970 [2025-03-03 15:15:37,873 INFO L226 Difference]: Without dead ends: 3210 [2025-03-03 15:15:37,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:37,876 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 368 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:37,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1020 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2025-03-03 15:15:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 3208. [2025-03-03 15:15:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.5597131275335203) internal successors, (5002), 3207 states have internal predecessors, (5002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 5002 transitions. [2025-03-03 15:15:37,953 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 5002 transitions. Word has length 195 [2025-03-03 15:15:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:37,954 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 5002 transitions. [2025-03-03 15:15:37,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 5002 transitions. [2025-03-03 15:15:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 15:15:37,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:37,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:37,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:15:37,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:37,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1638780481, now seen corresponding path program 1 times [2025-03-03 15:15:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:37,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148324040] [2025-03-03 15:15:37,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:37,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:37,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 15:15:38,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 15:15:38,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:38,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:38,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:38,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148324040] [2025-03-03 15:15:38,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148324040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:38,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:38,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:38,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614311154] [2025-03-03 15:15:38,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:38,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:38,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:38,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:38,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:38,118 INFO L87 Difference]: Start difference. First operand 3208 states and 5002 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:38,205 INFO L93 Difference]: Finished difference Result 8756 states and 13673 transitions. [2025-03-03 15:15:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:38,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-03-03 15:15:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:38,224 INFO L225 Difference]: With dead ends: 8756 [2025-03-03 15:15:38,225 INFO L226 Difference]: Without dead ends: 5622 [2025-03-03 15:15:38,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:38,230 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 355 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:38,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1000 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5622 states. [2025-03-03 15:15:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5622 to 5620. [2025-03-03 15:15:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 5619 states have (on average 1.5493860117458622) internal successors, (8706), 5619 states have internal predecessors, (8706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 8706 transitions. [2025-03-03 15:15:38,344 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 8706 transitions. Word has length 198 [2025-03-03 15:15:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:38,345 INFO L471 AbstractCegarLoop]: Abstraction has 5620 states and 8706 transitions. [2025-03-03 15:15:38,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 8706 transitions. [2025-03-03 15:15:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 15:15:38,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:38,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:38,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:15:38,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:38,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:38,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1193418398, now seen corresponding path program 1 times [2025-03-03 15:15:38,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:38,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072361327] [2025-03-03 15:15:38,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:38,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 15:15:38,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 15:15:38,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:38,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:38,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:38,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072361327] [2025-03-03 15:15:38,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072361327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:38,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:38,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:38,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622014450] [2025-03-03 15:15:38,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:38,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:38,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:38,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:38,476 INFO L87 Difference]: Start difference. First operand 5620 states and 8706 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:38,556 INFO L93 Difference]: Finished difference Result 15286 states and 23649 transitions. [2025-03-03 15:15:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-03-03 15:15:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:38,586 INFO L225 Difference]: With dead ends: 15286 [2025-03-03 15:15:38,589 INFO L226 Difference]: Without dead ends: 9746 [2025-03-03 15:15:38,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:38,598 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 342 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:38,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 980 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2025-03-03 15:15:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 9744. [2025-03-03 15:15:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9744 states, 9743 states have (on average 1.533203325464436) internal successors, (14938), 9743 states have internal predecessors, (14938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9744 states to 9744 states and 14938 transitions. [2025-03-03 15:15:38,818 INFO L78 Accepts]: Start accepts. Automaton has 9744 states and 14938 transitions. Word has length 201 [2025-03-03 15:15:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:38,819 INFO L471 AbstractCegarLoop]: Abstraction has 9744 states and 14938 transitions. [2025-03-03 15:15:38,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 9744 states and 14938 transitions. [2025-03-03 15:15:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 15:15:38,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:38,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:38,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:15:38,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:38,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash 695474163, now seen corresponding path program 1 times [2025-03-03 15:15:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:38,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507254487] [2025-03-03 15:15:38,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:38,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 15:15:38,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 15:15:38,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:38,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:39,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:39,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507254487] [2025-03-03 15:15:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507254487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:39,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:39,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111962775] [2025-03-03 15:15:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:39,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:39,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:39,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:39,091 INFO L87 Difference]: Start difference. First operand 9744 states and 14938 transitions. Second operand has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:40,147 INFO L93 Difference]: Finished difference Result 106345 states and 162311 transitions. [2025-03-03 15:15:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:40,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-03-03 15:15:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:40,335 INFO L225 Difference]: With dead ends: 106345 [2025-03-03 15:15:40,335 INFO L226 Difference]: Without dead ends: 96687 [2025-03-03 15:15:40,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:15:40,361 INFO L435 NwaCegarLoop]: 1868 mSDtfsCounter, 4514 mSDsluCounter, 7239 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4514 SdHoareTripleChecker+Valid, 9107 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:40,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4514 Valid, 9107 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:15:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96687 states. [2025-03-03 15:15:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96687 to 19331. [2025-03-03 15:15:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19331 states, 19330 states have (on average 1.5077082255561303) internal successors, (29144), 19330 states have internal predecessors, (29144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19331 states to 19331 states and 29144 transitions. [2025-03-03 15:15:41,218 INFO L78 Accepts]: Start accepts. Automaton has 19331 states and 29144 transitions. Word has length 204 [2025-03-03 15:15:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 19331 states and 29144 transitions. [2025-03-03 15:15:41,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 19331 states and 29144 transitions. [2025-03-03 15:15:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 15:15:41,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:41,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:41,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:15:41,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:41,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2122082246, now seen corresponding path program 1 times [2025-03-03 15:15:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158156816] [2025-03-03 15:15:41,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 15:15:41,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 15:15:41,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:41,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:41,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158156816] [2025-03-03 15:15:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158156816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:41,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:41,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59784351] [2025-03-03 15:15:41,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:41,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:41,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:41,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:41,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:41,349 INFO L87 Difference]: Start difference. First operand 19331 states and 29144 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:41,468 INFO L93 Difference]: Finished difference Result 46572 states and 70147 transitions. [2025-03-03 15:15:41,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:41,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-03-03 15:15:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:41,513 INFO L225 Difference]: With dead ends: 46572 [2025-03-03 15:15:41,513 INFO L226 Difference]: Without dead ends: 27325 [2025-03-03 15:15:41,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:41,535 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 415 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:41,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1321 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27325 states. [2025-03-03 15:15:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27325 to 27323. [2025-03-03 15:15:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27323 states, 27322 states have (on average 1.4901910548276114) internal successors, (40715), 27322 states have internal predecessors, (40715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27323 states to 27323 states and 40715 transitions. [2025-03-03 15:15:41,992 INFO L78 Accepts]: Start accepts. Automaton has 27323 states and 40715 transitions. Word has length 208 [2025-03-03 15:15:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:41,994 INFO L471 AbstractCegarLoop]: Abstraction has 27323 states and 40715 transitions. [2025-03-03 15:15:41,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27323 states and 40715 transitions. [2025-03-03 15:15:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 15:15:42,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:42,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:42,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:15:42,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:42,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash 87001645, now seen corresponding path program 1 times [2025-03-03 15:15:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:42,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763749508] [2025-03-03 15:15:42,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:42,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 15:15:42,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 15:15:42,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:42,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:42,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763749508] [2025-03-03 15:15:42,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763749508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:42,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:42,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:42,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33858221] [2025-03-03 15:15:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:42,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:42,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:42,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:42,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:42,518 INFO L87 Difference]: Start difference. First operand 27323 states and 40715 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:43,025 INFO L93 Difference]: Finished difference Result 54563 states and 81333 transitions. [2025-03-03 15:15:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:43,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-03-03 15:15:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:43,070 INFO L225 Difference]: With dead ends: 54563 [2025-03-03 15:15:43,070 INFO L226 Difference]: Without dead ends: 27325 [2025-03-03 15:15:43,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:43,098 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 1306 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:43,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 2776 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27325 states. [2025-03-03 15:15:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27325 to 27323. [2025-03-03 15:15:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27323 states, 27322 states have (on average 1.4772710636117414) internal successors, (40362), 27322 states have internal predecessors, (40362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27323 states to 27323 states and 40362 transitions. [2025-03-03 15:15:43,493 INFO L78 Accepts]: Start accepts. Automaton has 27323 states and 40362 transitions. Word has length 208 [2025-03-03 15:15:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:43,493 INFO L471 AbstractCegarLoop]: Abstraction has 27323 states and 40362 transitions. [2025-03-03 15:15:43,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 27323 states and 40362 transitions. [2025-03-03 15:15:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 15:15:43,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:43,520 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:43,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:15:43,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:43,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash -514000092, now seen corresponding path program 1 times [2025-03-03 15:15:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:43,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82225937] [2025-03-03 15:15:43,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:43,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:43,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 15:15:43,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 15:15:43,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:43,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82225937] [2025-03-03 15:15:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82225937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326287406] [2025-03-03 15:15:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:43,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:43,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:43,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:43,613 INFO L87 Difference]: Start difference. First operand 27323 states and 40362 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:44,115 INFO L93 Difference]: Finished difference Result 77793 states and 114802 transitions. [2025-03-03 15:15:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:44,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-03-03 15:15:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:44,194 INFO L225 Difference]: With dead ends: 77793 [2025-03-03 15:15:44,195 INFO L226 Difference]: Without dead ends: 54255 [2025-03-03 15:15:44,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:44,222 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 404 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:44,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 651 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54255 states. [2025-03-03 15:15:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54255 to 54253. [2025-03-03 15:15:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54253 states, 54252 states have (on average 1.4687753446877534) internal successors, (79684), 54252 states have internal predecessors, (79684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54253 states to 54253 states and 79684 transitions. [2025-03-03 15:15:44,869 INFO L78 Accepts]: Start accepts. Automaton has 54253 states and 79684 transitions. Word has length 209 [2025-03-03 15:15:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:44,869 INFO L471 AbstractCegarLoop]: Abstraction has 54253 states and 79684 transitions. [2025-03-03 15:15:44,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 54253 states and 79684 transitions. [2025-03-03 15:15:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 15:15:44,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:44,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:44,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:15:44,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:44,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1239734084, now seen corresponding path program 1 times [2025-03-03 15:15:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:44,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913338356] [2025-03-03 15:15:44,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:44,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 15:15:44,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 15:15:44,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:44,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:45,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913338356] [2025-03-03 15:15:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913338356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:45,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658169364] [2025-03-03 15:15:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:45,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:45,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:45,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:45,317 INFO L87 Difference]: Start difference. First operand 54253 states and 79684 transitions. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:46,512 INFO L93 Difference]: Finished difference Result 322468 states and 471946 transitions. [2025-03-03 15:15:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-03-03 15:15:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:46,786 INFO L225 Difference]: With dead ends: 322468 [2025-03-03 15:15:46,786 INFO L226 Difference]: Without dead ends: 285466 [2025-03-03 15:15:46,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:46,839 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 3800 mSDsluCounter, 4219 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3800 SdHoareTripleChecker+Valid, 5863 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:46,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3800 Valid, 5863 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285466 states. [2025-03-03 15:15:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285466 to 103674. [2025-03-03 15:15:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103674 states, 103673 states have (on average 1.4603127140142564) internal successors, (151395), 103673 states have internal predecessors, (151395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103674 states to 103674 states and 151395 transitions. [2025-03-03 15:15:49,350 INFO L78 Accepts]: Start accepts. Automaton has 103674 states and 151395 transitions. Word has length 209 [2025-03-03 15:15:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:49,351 INFO L471 AbstractCegarLoop]: Abstraction has 103674 states and 151395 transitions. [2025-03-03 15:15:49,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 103674 states and 151395 transitions. [2025-03-03 15:15:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 15:15:49,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:49,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:49,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:15:49,473 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:49,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1982862301, now seen corresponding path program 1 times [2025-03-03 15:15:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708276016] [2025-03-03 15:15:49,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:49,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 15:15:49,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 15:15:49,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:49,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:49,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:49,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708276016] [2025-03-03 15:15:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708276016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:49,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688381288] [2025-03-03 15:15:49,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:49,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:49,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:49,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:49,768 INFO L87 Difference]: Start difference. First operand 103674 states and 151395 transitions. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:50,965 INFO L93 Difference]: Finished difference Result 365512 states and 534262 transitions. [2025-03-03 15:15:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-03-03 15:15:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:51,356 INFO L225 Difference]: With dead ends: 365512 [2025-03-03 15:15:51,356 INFO L226 Difference]: Without dead ends: 330214 [2025-03-03 15:15:51,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:51,471 INFO L435 NwaCegarLoop]: 1402 mSDtfsCounter, 4015 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4015 SdHoareTripleChecker+Valid, 4815 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:51,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4015 Valid, 4815 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330214 states. [2025-03-03 15:15:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330214 to 168678. [2025-03-03 15:15:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168678 states, 168677 states have (on average 1.4527232521327744) internal successors, (245041), 168677 states have internal predecessors, (245041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168678 states to 168678 states and 245041 transitions. [2025-03-03 15:15:55,261 INFO L78 Accepts]: Start accepts. Automaton has 168678 states and 245041 transitions. Word has length 209 [2025-03-03 15:15:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:55,261 INFO L471 AbstractCegarLoop]: Abstraction has 168678 states and 245041 transitions. [2025-03-03 15:15:55,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 168678 states and 245041 transitions. [2025-03-03 15:15:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 15:15:55,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:55,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:55,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:15:55,407 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:15:55,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash 271835625, now seen corresponding path program 1 times [2025-03-03 15:15:55,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359134339] [2025-03-03 15:15:55,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:55,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 15:15:55,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 15:15:55,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:55,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:55,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359134339] [2025-03-03 15:15:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359134339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026581552] [2025-03-03 15:15:55,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:55,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:55,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:55,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:55,641 INFO L87 Difference]: Start difference. First operand 168678 states and 245041 transitions. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:57,513 INFO L93 Difference]: Finished difference Result 406088 states and 592822 transitions. [2025-03-03 15:15:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-03-03 15:15:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:57,965 INFO L225 Difference]: With dead ends: 406088 [2025-03-03 15:15:57,965 INFO L226 Difference]: Without dead ends: 370262 [2025-03-03 15:15:58,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:58,068 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 3769 mSDsluCounter, 4066 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3769 SdHoareTripleChecker+Valid, 5443 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:58,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3769 Valid, 5443 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370262 states. [2025-03-03 15:16:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370262 to 212938. [2025-03-03 15:16:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212938 states, 212937 states have (on average 1.4516922845724323) internal successors, (309119), 212937 states have internal predecessors, (309119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212938 states to 212938 states and 309119 transitions. [2025-03-03 15:16:02,118 INFO L78 Accepts]: Start accepts. Automaton has 212938 states and 309119 transitions. Word has length 209 [2025-03-03 15:16:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:02,118 INFO L471 AbstractCegarLoop]: Abstraction has 212938 states and 309119 transitions. [2025-03-03 15:16:02,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 212938 states and 309119 transitions. [2025-03-03 15:16:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 15:16:02,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:02,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:02,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:16:02,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:02,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1404646603, now seen corresponding path program 1 times [2025-03-03 15:16:02,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:02,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715441706] [2025-03-03 15:16:02,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:02,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:02,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 15:16:02,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 15:16:02,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:02,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:02,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:02,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715441706] [2025-03-03 15:16:02,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715441706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:02,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:02,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:02,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389059310] [2025-03-03 15:16:02,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:02,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:02,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:02,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:02,677 INFO L87 Difference]: Start difference. First operand 212938 states and 309119 transitions. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:04,004 INFO L93 Difference]: Finished difference Result 449672 states and 655942 transitions. [2025-03-03 15:16:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-03-03 15:16:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:04,483 INFO L225 Difference]: With dead ends: 449672 [2025-03-03 15:16:04,484 INFO L226 Difference]: Without dead ends: 413246 [2025-03-03 15:16:04,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:04,583 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 3488 mSDsluCounter, 4402 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 5997 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:04,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 5997 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413246 states. [2025-03-03 15:16:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413246 to 257915. [2025-03-03 15:16:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257915 states, 257914 states have (on average 1.4513209829633134) internal successors, (374316), 257914 states have internal predecessors, (374316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257915 states to 257915 states and 374316 transitions. [2025-03-03 15:16:09,068 INFO L78 Accepts]: Start accepts. Automaton has 257915 states and 374316 transitions. Word has length 209 [2025-03-03 15:16:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:09,068 INFO L471 AbstractCegarLoop]: Abstraction has 257915 states and 374316 transitions. [2025-03-03 15:16:09,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 257915 states and 374316 transitions. [2025-03-03 15:16:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 15:16:09,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:09,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:09,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:16:09,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:09,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1901363465, now seen corresponding path program 1 times [2025-03-03 15:16:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207546720] [2025-03-03 15:16:09,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:09,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 15:16:09,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 15:16:09,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:09,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207546720] [2025-03-03 15:16:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207546720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143346685] [2025-03-03 15:16:09,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:09,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:09,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:09,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:09,922 INFO L87 Difference]: Start difference. First operand 257915 states and 374316 transitions. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:11,520 INFO L93 Difference]: Finished difference Result 496742 states and 724276 transitions. [2025-03-03 15:16:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-03-03 15:16:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:12,008 INFO L225 Difference]: With dead ends: 496742 [2025-03-03 15:16:12,008 INFO L226 Difference]: Without dead ends: 459164 [2025-03-03 15:16:12,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:12,110 INFO L435 NwaCegarLoop]: 1753 mSDtfsCounter, 3671 mSDsluCounter, 5254 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3671 SdHoareTripleChecker+Valid, 7007 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:12,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3671 Valid, 7007 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459164 states. [2025-03-03 15:16:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459164 to 304092. [2025-03-03 15:16:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304092 states, 304091 states have (on average 1.4512925407197188) internal successors, (441325), 304091 states have internal predecessors, (441325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304092 states to 304092 states and 441325 transitions. [2025-03-03 15:16:16,935 INFO L78 Accepts]: Start accepts. Automaton has 304092 states and 441325 transitions. Word has length 209 [2025-03-03 15:16:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:16,936 INFO L471 AbstractCegarLoop]: Abstraction has 304092 states and 441325 transitions. [2025-03-03 15:16:16,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 304092 states and 441325 transitions. [2025-03-03 15:16:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 15:16:17,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:17,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:16:17,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:17,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -105983156, now seen corresponding path program 1 times [2025-03-03 15:16:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936399075] [2025-03-03 15:16:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:17,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 15:16:17,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 15:16:17,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:17,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:17,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936399075] [2025-03-03 15:16:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936399075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:17,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:17,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561734012] [2025-03-03 15:16:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:17,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:17,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:17,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:17,794 INFO L87 Difference]: Start difference. First operand 304092 states and 441325 transitions. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)